./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-max.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-three-array-max.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 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:30:29,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:30:29,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:30:29,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:30:29,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:30:29,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:30:29,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:30:29,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:30:29,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:30:29,306 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:30:29,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:30:29,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:30:29,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:30:29,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:30:29,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:30:29,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:30:29,311 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:30:29,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:30:29,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:30:29,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:30:29,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:30:29,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:30:29,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:30:29,312 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:30:29,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:30:29,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:30:29,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:30:29,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:30:29,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:30:29,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:30:29,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:30:29,312 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 -> 670814d0a16da58b0f26835e20c05a244e2f373856f13b9d4ff2a931783edf81 [2025-03-04 15:30:29,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:30:29,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:30:29,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:30:29,544 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:30:29,544 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:30:29,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2025-03-04 15:30:30,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192b5e698/7c8729c2e09d48a185352cdec674c25b/FLAG76c0e9ee0 [2025-03-04 15:30:30,833 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:30:30,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2025-03-04 15:30:30,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192b5e698/7c8729c2e09d48a185352cdec674c25b/FLAG76c0e9ee0 [2025-03-04 15:30:31,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192b5e698/7c8729c2e09d48a185352cdec674c25b [2025-03-04 15:30:31,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:30:31,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:30:31,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:30:31,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:30:31,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:30:31,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:30:31" (1/1) ... [2025-03-04 15:30:31,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc827a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:31, skipping insertion in model container [2025-03-04 15:30:31,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:30:31" (1/1) ... [2025-03-04 15:30:31,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:30:31,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:30:31,353 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:30:31,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:30:31,392 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:30:31,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:31 WrapperNode [2025-03-04 15:30:31,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:30:31,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:30:31,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:30:31,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:30:31,399 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:30:31" (1/1) ... [2025-03-04 15:30:31,408 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:30:31" (1/1) ... [2025-03-04 15:30:31,435 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 264 [2025-03-04 15:30:31,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:30:31,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:30:31,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:30:31,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:30:31,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:31" (1/1) ... [2025-03-04 15:30:31,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:31" (1/1) ... [2025-03-04 15:30:31,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:31" (1/1) ... [2025-03-04 15:30:31,469 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-03-04 15:30:31,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:31" (1/1) ... [2025-03-04 15:30:31,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:31" (1/1) ... [2025-03-04 15:30:31,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:31" (1/1) ... [2025-03-04 15:30:31,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:31" (1/1) ... [2025-03-04 15:30:31,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:31" (1/1) ... [2025-03-04 15:30:31,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:31" (1/1) ... [2025-03-04 15:30:31,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:30:31,489 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:30:31,489 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:30:31,489 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:30:31,489 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:31" (1/1) ... [2025-03-04 15:30:31,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:30:31,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:31,513 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:30:31,515 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:30:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:30:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:30:31,532 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:30:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:30:31,532 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:30:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:30:31,532 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:30:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:30:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:30:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:30:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:30:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:30:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:30:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:30:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:30:31,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:30:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:30:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:30:31,534 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:30:31,620 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:30:31,622 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:30:32,025 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:30:32,025 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:30:32,282 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:30:32,284 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:30:32,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:30:32 BoogieIcfgContainer [2025-03-04 15:30:32,284 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:30:32,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:30:32,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:30:32,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:30:32,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:30:31" (1/3) ... [2025-03-04 15:30:32,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153f18bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:30:32, skipping insertion in model container [2025-03-04 15:30:32,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:30:31" (2/3) ... [2025-03-04 15:30:32,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153f18bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:30:32, skipping insertion in model container [2025-03-04 15:30:32,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:30:32" (3/3) ... [2025-03-04 15:30:32,291 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2025-03-04 15:30:32,306 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:30:32,307 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-max.wvr.c that has 4 procedures, 95 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-03-04 15:30:32,307 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:30:32,386 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:30:32,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 105 transitions, 231 flow [2025-03-04 15:30:32,435 INFO L124 PetriNetUnfolderBase]: 11/102 cut-off events. [2025-03-04 15:30:32,437 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:30:32,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 11/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 266 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-04 15:30:32,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 105 transitions, 231 flow [2025-03-04 15:30:32,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 220 flow [2025-03-04 15:30:32,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:30:32,465 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;@1aca097e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:30:32,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-03-04 15:30:32,472 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:30:32,472 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:30:32,472 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:30:32,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:32,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:30:32,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:30:32,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:32,477 INFO L85 PathProgramCache]: Analyzing trace with hash 910156, now seen corresponding path program 1 times [2025-03-04 15:30:32,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:32,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124663281] [2025-03-04 15:30:32,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:32,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:32,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:30:32,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:30:32,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:32,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:32,708 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:30:32,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:32,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124663281] [2025-03-04 15:30:32,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124663281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:32,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:32,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:30:32,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671637128] [2025-03-04 15:30:32,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:32,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:32,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:32,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:32,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:32,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-04 15:30:32,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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:30:32,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:32,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-04 15:30:32,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:33,188 INFO L124 PetriNetUnfolderBase]: 1374/2592 cut-off events. [2025-03-04 15:30:33,188 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2025-03-04 15:30:33,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4608 conditions, 2592 events. 1374/2592 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17041 event pairs, 1018 based on Foata normal form. 3/1922 useless extension candidates. Maximal degree in co-relation 4086. Up to 1857 conditions per place. [2025-03-04 15:30:33,209 INFO L140 encePairwiseOnDemand]: 87/105 looper letters, 53 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2025-03-04 15:30:33,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 108 transitions, 360 flow [2025-03-04 15:30:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 263 transitions. [2025-03-04 15:30:33,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6261904761904762 [2025-03-04 15:30:33,219 INFO L175 Difference]: Start difference. First operand has 100 places, 101 transitions, 220 flow. Second operand 4 states and 263 transitions. [2025-03-04 15:30:33,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 108 transitions, 360 flow [2025-03-04 15:30:33,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 108 transitions, 348 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:30:33,226 INFO L231 Difference]: Finished difference. Result has 98 places, 108 transitions, 292 flow [2025-03-04 15:30:33,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=98, PETRI_TRANSITIONS=108} [2025-03-04 15:30:33,230 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2025-03-04 15:30:33,230 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 292 flow [2025-03-04 15:30:33,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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:30:33,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:33,230 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:30:33,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:30:33,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:30:33,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1345439807, now seen corresponding path program 1 times [2025-03-04 15:30:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:33,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815934874] [2025-03-04 15:30:33,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:33,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:30:33,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:30:33,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:33,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:33,359 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:30:33,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:33,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815934874] [2025-03-04 15:30:33,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815934874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:33,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394082601] [2025-03-04 15:30:33,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:33,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:33,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:33,362 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:30:33,363 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:30:33,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:30:33,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:30:33,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:33,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:33,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:30:33,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:33,462 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:30:33,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:30:33,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394082601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:33,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:30:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:30:33,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690012293] [2025-03-04 15:30:33,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:33,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:30:33,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:33,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:30:33,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:30:33,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-04 15:30:33,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 108 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 48.833333333333336) internal successors, (293), 6 states have internal predecessors, (293), 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:30:33,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:33,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-04 15:30:33,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:33,859 INFO L124 PetriNetUnfolderBase]: 1374/2589 cut-off events. [2025-03-04 15:30:33,860 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-03-04 15:30:33,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4532 conditions, 2589 events. 1374/2589 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17056 event pairs, 1018 based on Foata normal form. 3/1924 useless extension candidates. Maximal degree in co-relation 4459. Up to 1842 conditions per place. [2025-03-04 15:30:33,877 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 43 selfloop transitions, 17 changer transitions 0/105 dead transitions. [2025-03-04 15:30:33,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 105 transitions, 400 flow [2025-03-04 15:30:33,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:30:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:30:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 351 transitions. [2025-03-04 15:30:33,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-03-04 15:30:33,880 INFO L175 Difference]: Start difference. First operand has 98 places, 108 transitions, 292 flow. Second operand 6 states and 351 transitions. [2025-03-04 15:30:33,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 105 transitions, 400 flow [2025-03-04 15:30:33,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 105 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:30:33,884 INFO L231 Difference]: Finished difference. Result has 100 places, 105 transitions, 314 flow [2025-03-04 15:30:33,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=100, PETRI_TRANSITIONS=105} [2025-03-04 15:30:33,885 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2025-03-04 15:30:33,885 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 105 transitions, 314 flow [2025-03-04 15:30:33,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.833333333333336) internal successors, (293), 6 states have internal predecessors, (293), 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:30:33,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:33,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:30:33,892 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:30:34,088 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:30:34,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:30:34,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:34,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1346612458, now seen corresponding path program 1 times [2025-03-04 15:30:34,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:34,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081392391] [2025-03-04 15:30:34,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:34,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:34,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:30:34,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:30:34,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:34,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:34,203 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:30:34,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:34,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081392391] [2025-03-04 15:30:34,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081392391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:34,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:34,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:30:34,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552156893] [2025-03-04 15:30:34,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:34,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:34,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:34,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:34,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:34,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-04 15:30:34,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 105 transitions, 314 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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:30:34,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:34,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-04 15:30:34,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:34,520 INFO L124 PetriNetUnfolderBase]: 1375/2606 cut-off events. [2025-03-04 15:30:34,520 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-04 15:30:34,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4581 conditions, 2606 events. 1375/2606 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17081 event pairs, 1018 based on Foata normal form. 4/1941 useless extension candidates. Maximal degree in co-relation 4495. Up to 1857 conditions per place. [2025-03-04 15:30:34,532 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 64 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2025-03-04 15:30:34,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 110 transitions, 472 flow [2025-03-04 15:30:34,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-04 15:30:34,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.569047619047619 [2025-03-04 15:30:34,534 INFO L175 Difference]: Start difference. First operand has 100 places, 105 transitions, 314 flow. Second operand 4 states and 239 transitions. [2025-03-04 15:30:34,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 110 transitions, 472 flow [2025-03-04 15:30:34,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 110 transitions, 434 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 15:30:34,541 INFO L231 Difference]: Finished difference. Result has 99 places, 108 transitions, 340 flow [2025-03-04 15:30:34,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=99, PETRI_TRANSITIONS=108} [2025-03-04 15:30:34,542 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -1 predicate places. [2025-03-04 15:30:34,542 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 340 flow [2025-03-04 15:30:34,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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:30:34,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:34,543 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:30:34,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:30:34,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:30:34,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:34,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1241038155, now seen corresponding path program 1 times [2025-03-04 15:30:34,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:34,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53236391] [2025-03-04 15:30:34,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:34,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:34,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:30:34,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:30:34,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:34,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:34,614 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:30:34,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:34,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53236391] [2025-03-04 15:30:34,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53236391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:34,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573998811] [2025-03-04 15:30:34,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:34,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:34,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:34,616 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:30:34,618 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:30:34,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:30:34,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:30:34,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:34,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:34,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:30:34,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:34,696 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:30:34,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:34,728 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:30:34,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573998811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:34,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:34,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:30:34,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657166444] [2025-03-04 15:30:34,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:34,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:30:34,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:34,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:30:34,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:30:34,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-04 15:30:34,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 108 transitions, 340 flow. Second operand has 12 states, 12 states have (on average 49.083333333333336) internal successors, (589), 12 states have internal predecessors, (589), 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:30:34,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:34,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-04 15:30:34,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:35,091 INFO L124 PetriNetUnfolderBase]: 1384/2642 cut-off events. [2025-03-04 15:30:35,092 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-03-04 15:30:35,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4689 conditions, 2642 events. 1384/2642 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17378 event pairs, 1018 based on Foata normal form. 9/1981 useless extension candidates. Maximal degree in co-relation 4506. Up to 1862 conditions per place. [2025-03-04 15:30:35,103 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 53 selfloop transitions, 37 changer transitions 0/135 dead transitions. [2025-03-04 15:30:35,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 135 transitions, 661 flow [2025-03-04 15:30:35,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:30:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:30:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 576 transitions. [2025-03-04 15:30:35,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2025-03-04 15:30:35,105 INFO L175 Difference]: Start difference. First operand has 99 places, 108 transitions, 340 flow. Second operand 10 states and 576 transitions. [2025-03-04 15:30:35,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 135 transitions, 661 flow [2025-03-04 15:30:35,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 135 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:30:35,108 INFO L231 Difference]: Finished difference. Result has 111 places, 135 transitions, 605 flow [2025-03-04 15:30:35,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=605, PETRI_PLACES=111, PETRI_TRANSITIONS=135} [2025-03-04 15:30:35,109 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-03-04 15:30:35,109 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 135 transitions, 605 flow [2025-03-04 15:30:35,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 49.083333333333336) internal successors, (589), 12 states have internal predecessors, (589), 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:30:35,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:35,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:35,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:30:35,314 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,SelfDestructingSolverStorable3 [2025-03-04 15:30:35,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:30:35,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:35,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1204685938, now seen corresponding path program 1 times [2025-03-04 15:30:35,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:35,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580023810] [2025-03-04 15:30:35,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:35,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:35,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:30:35,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:30:35,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:35,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:35,403 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:30:35,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:35,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580023810] [2025-03-04 15:30:35,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580023810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:35,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:35,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:30:35,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720461995] [2025-03-04 15:30:35,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:35,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:30:35,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:35,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:30:35,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:30:35,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 105 [2025-03-04 15:30:35,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 135 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:35,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:35,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 105 [2025-03-04 15:30:35,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:35,653 INFO L124 PetriNetUnfolderBase]: 1383/2641 cut-off events. [2025-03-04 15:30:35,653 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2025-03-04 15:30:35,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4749 conditions, 2641 events. 1383/2641 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17310 event pairs, 1018 based on Foata normal form. 1/1978 useless extension candidates. Maximal degree in co-relation 4646. Up to 1888 conditions per place. [2025-03-04 15:30:35,667 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 84 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-03-04 15:30:35,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 134 transitions, 773 flow [2025-03-04 15:30:35,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:30:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:30:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-03-04 15:30:35,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-03-04 15:30:35,669 INFO L175 Difference]: Start difference. First operand has 111 places, 135 transitions, 605 flow. Second operand 3 states and 213 transitions. [2025-03-04 15:30:35,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 134 transitions, 773 flow [2025-03-04 15:30:35,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 134 transitions, 736 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 15:30:35,675 INFO L231 Difference]: Finished difference. Result has 111 places, 134 transitions, 568 flow [2025-03-04 15:30:35,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=111, PETRI_TRANSITIONS=134} [2025-03-04 15:30:35,676 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-03-04 15:30:35,677 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 134 transitions, 568 flow [2025-03-04 15:30:35,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:35,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:35,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:35,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:30:35,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:30:35,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash -651942143, now seen corresponding path program 1 times [2025-03-04 15:30:35,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:35,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423849386] [2025-03-04 15:30:35,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:35,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:35,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:30:35,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:30:35,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:35,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:35,761 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:30:35,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:35,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423849386] [2025-03-04 15:30:35,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423849386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:35,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:35,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:30:35,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436527026] [2025-03-04 15:30:35,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:35,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:35,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:35,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:35,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:35,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 105 [2025-03-04 15:30:35,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 134 transitions, 568 flow. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:35,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:35,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 105 [2025-03-04 15:30:35,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:36,021 INFO L124 PetriNetUnfolderBase]: 1381/2639 cut-off events. [2025-03-04 15:30:36,021 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-04 15:30:36,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 2639 events. 1381/2639 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17160 event pairs, 1018 based on Foata normal form. 2/1977 useless extension candidates. Maximal degree in co-relation 4697. Up to 1875 conditions per place. [2025-03-04 15:30:36,034 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 72 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2025-03-04 15:30:36,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 132 transitions, 723 flow [2025-03-04 15:30:36,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2025-03-04 15:30:36,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2025-03-04 15:30:36,036 INFO L175 Difference]: Start difference. First operand has 111 places, 134 transitions, 568 flow. Second operand 4 states and 272 transitions. [2025-03-04 15:30:36,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 132 transitions, 723 flow [2025-03-04 15:30:36,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 132 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:30:36,039 INFO L231 Difference]: Finished difference. Result has 112 places, 132 transitions, 565 flow [2025-03-04 15:30:36,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=565, PETRI_PLACES=112, PETRI_TRANSITIONS=132} [2025-03-04 15:30:36,039 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 12 predicate places. [2025-03-04 15:30:36,040 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 132 transitions, 565 flow [2025-03-04 15:30:36,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:36,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:36,040 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:30:36,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:30:36,040 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:30:36,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:36,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1797833976, now seen corresponding path program 2 times [2025-03-04 15:30:36,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:36,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963844230] [2025-03-04 15:30:36,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:36,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:36,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:30:36,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:30:36,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:36,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:30:36,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:36,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963844230] [2025-03-04 15:30:36,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963844230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:36,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504083990] [2025-03-04 15:30:36,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:30:36,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:36,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:36,083 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:30:36,085 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:30:36,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:30:36,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:30:36,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:30:36,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:36,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:30:36,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:30:36,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:30:36,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504083990] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:36,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:36,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-04 15:30:36,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934298713] [2025-03-04 15:30:36,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:36,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:30:36,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:36,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:30:36,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:30:36,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-04 15:30:36,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 132 transitions, 565 flow. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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:30:36,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:36,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-04 15:30:36,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:36,519 INFO L124 PetriNetUnfolderBase]: 1381/2638 cut-off events. [2025-03-04 15:30:36,519 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-03-04 15:30:36,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4722 conditions, 2638 events. 1381/2638 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17149 event pairs, 1018 based on Foata normal form. 1/1977 useless extension candidates. Maximal degree in co-relation 4626. Up to 1879 conditions per place. [2025-03-04 15:30:36,531 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 71 selfloop transitions, 15 changer transitions 0/131 dead transitions. [2025-03-04 15:30:36,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 131 transitions, 727 flow [2025-03-04 15:30:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:36,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2025-03-04 15:30:36,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2025-03-04 15:30:36,535 INFO L175 Difference]: Start difference. First operand has 112 places, 132 transitions, 565 flow. Second operand 4 states and 243 transitions. [2025-03-04 15:30:36,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 131 transitions, 727 flow [2025-03-04 15:30:36,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 131 transitions, 703 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:30:36,538 INFO L231 Difference]: Finished difference. Result has 111 places, 131 transitions, 561 flow [2025-03-04 15:30:36,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=561, PETRI_PLACES=111, PETRI_TRANSITIONS=131} [2025-03-04 15:30:36,538 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-03-04 15:30:36,538 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 131 transitions, 561 flow [2025-03-04 15:30:36,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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:30:36,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:36,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:36,546 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:30:36,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:36,741 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:30:36,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:36,741 INFO L85 PathProgramCache]: Analyzing trace with hash -6733540, now seen corresponding path program 1 times [2025-03-04 15:30:36,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:36,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947583921] [2025-03-04 15:30:36,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:36,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:36,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:30:36,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:30:36,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:36,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:37,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:37,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947583921] [2025-03-04 15:30:37,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947583921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:37,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770347944] [2025-03-04 15:30:37,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:37,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:37,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:37,032 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:30:37,035 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:30:37,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:30:37,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:30:37,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:37,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:37,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:30:37,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:37,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:30:37,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:30:37,193 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:30:37,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:30:37,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:30:37,212 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 17 treesize of output 9 [2025-03-04 15:30:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:37,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:37,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:30:37,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-04 15:30:37,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:30:37,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-03-04 15:30:37,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-04 15:30:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:37,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770347944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:37,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:37,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 15:30:37,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173468946] [2025-03-04 15:30:37,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:37,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 15:30:37,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:37,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 15:30:37,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=144, Unknown=2, NotChecked=0, Total=182 [2025-03-04 15:30:37,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 105 [2025-03-04 15:30:37,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 131 transitions, 561 flow. Second operand has 14 states, 14 states have (on average 37.857142857142854) internal successors, (530), 14 states have internal predecessors, (530), 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:30:37,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:37,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 105 [2025-03-04 15:30:37,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:37,990 INFO L124 PetriNetUnfolderBase]: 1379/2641 cut-off events. [2025-03-04 15:30:37,991 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-03-04 15:30:37,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4755 conditions, 2641 events. 1379/2641 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17161 event pairs, 1018 based on Foata normal form. 0/1975 useless extension candidates. Maximal degree in co-relation 4664. Up to 1841 conditions per place. [2025-03-04 15:30:38,005 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 86 selfloop transitions, 24 changer transitions 0/139 dead transitions. [2025-03-04 15:30:38,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 139 transitions, 797 flow [2025-03-04 15:30:38,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:30:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:30:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 477 transitions. [2025-03-04 15:30:38,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.412987012987013 [2025-03-04 15:30:38,008 INFO L175 Difference]: Start difference. First operand has 111 places, 131 transitions, 561 flow. Second operand 11 states and 477 transitions. [2025-03-04 15:30:38,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 139 transitions, 797 flow [2025-03-04 15:30:38,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 139 transitions, 767 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:30:38,011 INFO L231 Difference]: Finished difference. Result has 117 places, 130 transitions, 577 flow [2025-03-04 15:30:38,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=577, PETRI_PLACES=117, PETRI_TRANSITIONS=130} [2025-03-04 15:30:38,011 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 17 predicate places. [2025-03-04 15:30:38,011 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 130 transitions, 577 flow [2025-03-04 15:30:38,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 37.857142857142854) internal successors, (530), 14 states have internal predecessors, (530), 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:30:38,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:38,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:38,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:30:38,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:38,218 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:30:38,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:38,219 INFO L85 PathProgramCache]: Analyzing trace with hash -208709507, now seen corresponding path program 1 times [2025-03-04 15:30:38,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:38,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307891723] [2025-03-04 15:30:38,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:38,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:38,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:30:38,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:30:38,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:38,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:38,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:38,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307891723] [2025-03-04 15:30:38,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307891723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:38,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059711091] [2025-03-04 15:30:38,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:38,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:38,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:38,486 INFO L229 MonitoredProcess]: Starting monitored process 6 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:30:38,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:30:38,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:30:38,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:30:38,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:38,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:38,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 15:30:38,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:38,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:30:38,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:30:38,613 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:30:38,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:30:38,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 15:30:38,636 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 15 treesize of output 7 [2025-03-04 15:30:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:38,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:38,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:30:38,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-04 15:30:38,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:30:38,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-03-04 15:30:38,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-04 15:30:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:38,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059711091] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:38,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:38,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 15:30:38,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856488113] [2025-03-04 15:30:38,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:38,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 15:30:38,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:38,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 15:30:38,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2025-03-04 15:30:38,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 105 [2025-03-04 15:30:38,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 130 transitions, 577 flow. Second operand has 14 states, 14 states have (on average 37.857142857142854) internal successors, (530), 14 states have internal predecessors, (530), 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:30:38,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:38,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 105 [2025-03-04 15:30:38,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:39,338 INFO L124 PetriNetUnfolderBase]: 1379/2640 cut-off events. [2025-03-04 15:30:39,339 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2025-03-04 15:30:39,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4761 conditions, 2640 events. 1379/2640 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17168 event pairs, 1018 based on Foata normal form. 1/1978 useless extension candidates. Maximal degree in co-relation 4666. Up to 1845 conditions per place. [2025-03-04 15:30:39,348 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 79 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2025-03-04 15:30:39,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 133 transitions, 789 flow [2025-03-04 15:30:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:30:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:30:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 469 transitions. [2025-03-04 15:30:39,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2025-03-04 15:30:39,350 INFO L175 Difference]: Start difference. First operand has 117 places, 130 transitions, 577 flow. Second operand 11 states and 469 transitions. [2025-03-04 15:30:39,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 133 transitions, 789 flow [2025-03-04 15:30:39,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 133 transitions, 762 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:30:39,356 INFO L231 Difference]: Finished difference. Result has 122 places, 129 transitions, 596 flow [2025-03-04 15:30:39,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=596, PETRI_PLACES=122, PETRI_TRANSITIONS=129} [2025-03-04 15:30:39,357 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 22 predicate places. [2025-03-04 15:30:39,357 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 596 flow [2025-03-04 15:30:39,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 37.857142857142854) internal successors, (530), 14 states have internal predecessors, (530), 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:30:39,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:39,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:39,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:30:39,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:39,558 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:30:39,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2119942174, now seen corresponding path program 1 times [2025-03-04 15:30:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:39,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541556420] [2025-03-04 15:30:39,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:39,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:30:39,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:30:39,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:39,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:39,868 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:30:39,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:39,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541556420] [2025-03-04 15:30:39,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541556420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:39,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707732518] [2025-03-04 15:30:39,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:39,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:39,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:39,872 INFO L229 MonitoredProcess]: Starting monitored process 7 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:30:39,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:30:39,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:30:39,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:30:39,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:39,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:39,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 15:30:39,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:39,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:30:39,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:30:39,998 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 15:30:39,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 15:30:40,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:30:40,026 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:30:40,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:30:40,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:30:40,047 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 17 treesize of output 9 [2025-03-04 15:30:40,084 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:30:40,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:40,106 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_157 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_157) c_~A~0.base) c_~A~0.offset)))) is different from false [2025-03-04 15:30:40,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:30:40,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-03-04 15:30:40,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:30:40,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 135 [2025-03-04 15:30:40,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-03-04 15:30:40,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-03-04 15:30:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-04 15:30:40,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707732518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:40,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:40,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:30:40,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824881045] [2025-03-04 15:30:40,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:40,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:30:40,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:40,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:30:40,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=255, Unknown=2, NotChecked=32, Total=342 [2025-03-04 15:30:40,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 105 [2025-03-04 15:30:40,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 129 transitions, 596 flow. Second operand has 19 states, 19 states have (on average 33.63157894736842) internal successors, (639), 19 states have internal predecessors, (639), 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:30:40,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:40,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 105 [2025-03-04 15:30:40,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:40,940 INFO L124 PetriNetUnfolderBase]: 1378/2636 cut-off events. [2025-03-04 15:30:40,941 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2025-03-04 15:30:40,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4763 conditions, 2636 events. 1378/2636 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17116 event pairs, 1018 based on Foata normal form. 1/1977 useless extension candidates. Maximal degree in co-relation 4668. Up to 1842 conditions per place. [2025-03-04 15:30:40,950 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 81 selfloop transitions, 28 changer transitions 0/134 dead transitions. [2025-03-04 15:30:40,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 134 transitions, 822 flow [2025-03-04 15:30:40,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:30:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:30:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 534 transitions. [2025-03-04 15:30:40,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.363265306122449 [2025-03-04 15:30:40,953 INFO L175 Difference]: Start difference. First operand has 122 places, 129 transitions, 596 flow. Second operand 14 states and 534 transitions. [2025-03-04 15:30:40,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 134 transitions, 822 flow [2025-03-04 15:30:40,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 134 transitions, 770 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-03-04 15:30:40,956 INFO L231 Difference]: Finished difference. Result has 126 places, 128 transitions, 608 flow [2025-03-04 15:30:40,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=608, PETRI_PLACES=126, PETRI_TRANSITIONS=128} [2025-03-04 15:30:40,956 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 26 predicate places. [2025-03-04 15:30:40,956 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 128 transitions, 608 flow [2025-03-04 15:30:40,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 33.63157894736842) internal successors, (639), 19 states have internal predecessors, (639), 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:30:40,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:40,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:40,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:30:41,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:41,158 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:30:41,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:41,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1293698767, now seen corresponding path program 1 times [2025-03-04 15:30:41,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:41,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016812035] [2025-03-04 15:30:41,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:41,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:41,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:30:41,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:30:41,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:41,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:41,420 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:30:41,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:41,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016812035] [2025-03-04 15:30:41,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016812035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:30:41,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424775273] [2025-03-04 15:30:41,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:41,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:30:41,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:30:41,423 INFO L229 MonitoredProcess]: Starting monitored process 8 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:30:41,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:30:41,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:30:41,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:30:41,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:41,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:41,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 15:30:41,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:30:41,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:30:41,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:30:41,532 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 15:30:41,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 15:30:41,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 15:30:41,558 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:30:41,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:30:41,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 15:30:41,572 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 15 treesize of output 7 [2025-03-04 15:30:41,618 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:30:41,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:30:41,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:30:41,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-04 15:30:41,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:30:41,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 117 [2025-03-04 15:30:41,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-03-04 15:30:41,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 15:30:41,873 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:30:41,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424775273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:30:41,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:30:41,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-04 15:30:41,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787903140] [2025-03-04 15:30:41,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:30:41,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:30:41,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:41,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:30:41,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=283, Unknown=4, NotChecked=0, Total=342 [2025-03-04 15:30:45,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:30:49,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:30:54,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:30:58,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:31:02,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:31:06,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:31:10,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:31:14,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:31:18,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:31:22,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:31:22,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 105 [2025-03-04 15:31:22,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 128 transitions, 608 flow. Second operand has 19 states, 19 states have (on average 33.578947368421055) internal successors, (638), 19 states have internal predecessors, (638), 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:31:22,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:22,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 105 [2025-03-04 15:31:22,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:23,137 INFO L124 PetriNetUnfolderBase]: 1378/2636 cut-off events. [2025-03-04 15:31:23,137 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2025-03-04 15:31:23,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4782 conditions, 2636 events. 1378/2636 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17156 event pairs, 1018 based on Foata normal form. 4/1982 useless extension candidates. Maximal degree in co-relation 4709. Up to 1846 conditions per place. [2025-03-04 15:31:23,144 INFO L140 encePairwiseOnDemand]: 84/105 looper letters, 75 selfloop transitions, 32 changer transitions 1/133 dead transitions. [2025-03-04 15:31:23,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 133 transitions, 846 flow [2025-03-04 15:31:23,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:31:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:31:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 623 transitions. [2025-03-04 15:31:23,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34901960784313724 [2025-03-04 15:31:23,147 INFO L175 Difference]: Start difference. First operand has 126 places, 128 transitions, 608 flow. Second operand 17 states and 623 transitions. [2025-03-04 15:31:23,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 133 transitions, 846 flow [2025-03-04 15:31:23,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 133 transitions, 824 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 15:31:23,150 INFO L231 Difference]: Finished difference. Result has 140 places, 131 transitions, 679 flow [2025-03-04 15:31:23,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=679, PETRI_PLACES=140, PETRI_TRANSITIONS=131} [2025-03-04 15:31:23,152 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 40 predicate places. [2025-03-04 15:31:23,152 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 131 transitions, 679 flow [2025-03-04 15:31:23,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 33.578947368421055) internal successors, (638), 19 states have internal predecessors, (638), 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:31:23,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:23,153 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:23,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 15:31:23,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:23,354 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:23,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:23,354 INFO L85 PathProgramCache]: Analyzing trace with hash 535696082, now seen corresponding path program 1 times [2025-03-04 15:31:23,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:23,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654295651] [2025-03-04 15:31:23,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:23,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:23,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:31:23,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:31:23,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:23,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:31:23,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:23,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654295651] [2025-03-04 15:31:23,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654295651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477839677] [2025-03-04 15:31:23,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:23,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:23,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:23,482 INFO L229 MonitoredProcess]: Starting monitored process 9 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:31:23,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:31:23,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:31:23,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:31:23,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:23,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:23,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:31:23,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:31:23,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:31:23,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477839677] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:23,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:23,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-03-04 15:31:23,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472058668] [2025-03-04 15:31:23,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:23,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 15:31:23,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:23,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 15:31:23,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:31:23,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-04 15:31:23,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 131 transitions, 679 flow. Second operand has 21 states, 21 states have (on average 49.285714285714285) internal successors, (1035), 21 states have internal predecessors, (1035), 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:31:23,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:23,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-04 15:31:23,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:24,627 INFO L124 PetriNetUnfolderBase]: 2743/5220 cut-off events. [2025-03-04 15:31:24,628 INFO L125 PetriNetUnfolderBase]: For 381/381 co-relation queries the response was YES. [2025-03-04 15:31:24,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9361 conditions, 5220 events. 2743/5220 cut-off events. For 381/381 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 35995 event pairs, 2036 based on Foata normal form. 2/3938 useless extension candidates. Maximal degree in co-relation 9310. Up to 1863 conditions per place. [2025-03-04 15:31:24,647 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 93 selfloop transitions, 46 changer transitions 0/181 dead transitions. [2025-03-04 15:31:24,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 181 transitions, 1184 flow [2025-03-04 15:31:24,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:31:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:31:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 639 transitions. [2025-03-04 15:31:24,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5532467532467532 [2025-03-04 15:31:24,649 INFO L175 Difference]: Start difference. First operand has 140 places, 131 transitions, 679 flow. Second operand 11 states and 639 transitions. [2025-03-04 15:31:24,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 181 transitions, 1184 flow [2025-03-04 15:31:24,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 181 transitions, 1118 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-03-04 15:31:24,655 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 774 flow [2025-03-04 15:31:24,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=774, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2025-03-04 15:31:24,656 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 41 predicate places. [2025-03-04 15:31:24,657 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 774 flow [2025-03-04 15:31:24,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.285714285714285) internal successors, (1035), 21 states have internal predecessors, (1035), 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:31:24,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:24,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:24,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:31:24,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 15:31:24,859 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:24,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:24,860 INFO L85 PathProgramCache]: Analyzing trace with hash 574936650, now seen corresponding path program 1 times [2025-03-04 15:31:24,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:24,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233691932] [2025-03-04 15:31:24,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:24,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:24,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:31:24,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:31:24,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:24,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:31:24,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:24,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233691932] [2025-03-04 15:31:24,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233691932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:24,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:24,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:31:24,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401378110] [2025-03-04 15:31:24,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:24,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:24,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:24,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:24,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:31:24,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 105 [2025-03-04 15:31:24,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 774 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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:31:24,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:24,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 105 [2025-03-04 15:31:24,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:25,374 INFO L124 PetriNetUnfolderBase]: 2743/5208 cut-off events. [2025-03-04 15:31:25,375 INFO L125 PetriNetUnfolderBase]: For 359/359 co-relation queries the response was YES. [2025-03-04 15:31:25,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9378 conditions, 5208 events. 2743/5208 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 36233 event pairs, 2036 based on Foata normal form. 2/3900 useless extension candidates. Maximal degree in co-relation 9327. Up to 3731 conditions per place. [2025-03-04 15:31:25,392 INFO L140 encePairwiseOnDemand]: 91/105 looper letters, 88 selfloop transitions, 20 changer transitions 0/139 dead transitions. [2025-03-04 15:31:25,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 139 transitions, 994 flow [2025-03-04 15:31:25,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:31:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:31:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 298 transitions. [2025-03-04 15:31:25,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.473015873015873 [2025-03-04 15:31:25,394 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 774 flow. Second operand 6 states and 298 transitions. [2025-03-04 15:31:25,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 139 transitions, 994 flow [2025-03-04 15:31:25,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 139 transitions, 913 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-04 15:31:25,398 INFO L231 Difference]: Finished difference. Result has 140 places, 139 transitions, 763 flow [2025-03-04 15:31:25,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=763, PETRI_PLACES=140, PETRI_TRANSITIONS=139} [2025-03-04 15:31:25,399 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 40 predicate places. [2025-03-04 15:31:25,399 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 139 transitions, 763 flow [2025-03-04 15:31:25,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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:31:25,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:25,399 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1] [2025-03-04 15:31:25,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:31:25,399 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:25,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:25,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1040732735, now seen corresponding path program 2 times [2025-03-04 15:31:25,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:25,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746350575] [2025-03-04 15:31:25,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:25,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:25,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 15:31:25,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-03-04 15:31:25,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:25,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:31:25,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:25,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746350575] [2025-03-04 15:31:25,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746350575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:25,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163363693] [2025-03-04 15:31:25,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:25,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:25,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:25,440 INFO L229 MonitoredProcess]: Starting monitored process 10 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:31:25,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:31:25,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 15:31:25,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-03-04 15:31:25,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:25,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:25,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:31:25,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:31:25,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 15:31:25,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163363693] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:25,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:25,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 15:31:25,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504801694] [2025-03-04 15:31:25,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:25,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:25,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:25,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:25,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:31:25,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-04 15:31:25,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 139 transitions, 763 flow. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 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:31:25,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:25,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-04 15:31:25,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:25,969 INFO L124 PetriNetUnfolderBase]: 2745/5206 cut-off events. [2025-03-04 15:31:25,969 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2025-03-04 15:31:25,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9350 conditions, 5206 events. 2745/5206 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 36129 event pairs, 2036 based on Foata normal form. 2/3898 useless extension candidates. Maximal degree in co-relation 9298. Up to 3699 conditions per place. [2025-03-04 15:31:25,987 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 55 selfloop transitions, 40 changer transitions 0/137 dead transitions. [2025-03-04 15:31:25,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 137 transitions, 933 flow [2025-03-04 15:31:25,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:31:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:31:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 290 transitions. [2025-03-04 15:31:25,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-03-04 15:31:25,989 INFO L175 Difference]: Start difference. First operand has 140 places, 139 transitions, 763 flow. Second operand 5 states and 290 transitions. [2025-03-04 15:31:25,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 137 transitions, 933 flow [2025-03-04 15:31:25,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 137 transitions, 873 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-04 15:31:25,992 INFO L231 Difference]: Finished difference. Result has 134 places, 137 transitions, 763 flow [2025-03-04 15:31:25,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=763, PETRI_PLACES=134, PETRI_TRANSITIONS=137} [2025-03-04 15:31:25,992 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 34 predicate places. [2025-03-04 15:31:25,993 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 137 transitions, 763 flow [2025-03-04 15:31:25,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 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:31:25,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:25,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:25,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 15:31:26,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 15:31:26,197 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:26,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:26,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1186625962, now seen corresponding path program 1 times [2025-03-04 15:31:26,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:26,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548314455] [2025-03-04 15:31:26,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:26,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:26,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:31:26,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:31:26,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:26,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:31:26,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:26,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548314455] [2025-03-04 15:31:26,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548314455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:26,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:26,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:31:26,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872012970] [2025-03-04 15:31:26,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:26,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:31:26,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:26,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:31:26,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:31:26,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 105 [2025-03-04 15:31:26,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 137 transitions, 763 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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:31:26,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:26,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 105 [2025-03-04 15:31:26,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:27,089 INFO L124 PetriNetUnfolderBase]: 5865/10330 cut-off events. [2025-03-04 15:31:27,089 INFO L125 PetriNetUnfolderBase]: For 344/344 co-relation queries the response was YES. [2025-03-04 15:31:27,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18733 conditions, 10330 events. 5865/10330 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 76728 event pairs, 2186 based on Foata normal form. 284/7972 useless extension candidates. Maximal degree in co-relation 18688. Up to 6204 conditions per place. [2025-03-04 15:31:27,117 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 136 selfloop transitions, 4 changer transitions 0/180 dead transitions. [2025-03-04 15:31:27,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 180 transitions, 1133 flow [2025-03-04 15:31:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 303 transitions. [2025-03-04 15:31:27,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7214285714285714 [2025-03-04 15:31:27,118 INFO L175 Difference]: Start difference. First operand has 134 places, 137 transitions, 763 flow. Second operand 4 states and 303 transitions. [2025-03-04 15:31:27,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 180 transitions, 1133 flow [2025-03-04 15:31:27,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 180 transitions, 1058 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:31:27,121 INFO L231 Difference]: Finished difference. Result has 136 places, 140 transitions, 717 flow [2025-03-04 15:31:27,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=717, PETRI_PLACES=136, PETRI_TRANSITIONS=140} [2025-03-04 15:31:27,123 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 36 predicate places. [2025-03-04 15:31:27,123 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 140 transitions, 717 flow [2025-03-04 15:31:27,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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:31:27,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:27,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:27,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:31:27,123 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:27,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:27,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2137068283, now seen corresponding path program 1 times [2025-03-04 15:31:27,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:27,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019828515] [2025-03-04 15:31:27,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:27,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:27,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:31:27,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:31:27,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:27,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:31:27,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:27,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019828515] [2025-03-04 15:31:27,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019828515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:27,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484809125] [2025-03-04 15:31:27,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:27,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:27,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:27,222 INFO L229 MonitoredProcess]: Starting monitored process 11 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:31:27,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:31:27,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:31:27,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:31:27,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:27,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:27,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:31:27,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:31:27,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:31:27,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484809125] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:27,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:27,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 15:31:27,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299413431] [2025-03-04 15:31:27,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:27,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:31:27,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:27,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:31:27,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:31:27,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 105 [2025-03-04 15:31:27,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 140 transitions, 717 flow. Second operand has 15 states, 15 states have (on average 49.06666666666667) internal successors, (736), 15 states have internal predecessors, (736), 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:31:27,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:27,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 105 [2025-03-04 15:31:27,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:28,160 INFO L124 PetriNetUnfolderBase]: 2995/5194 cut-off events. [2025-03-04 15:31:28,160 INFO L125 PetriNetUnfolderBase]: For 2139/2392 co-relation queries the response was YES. [2025-03-04 15:31:28,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11642 conditions, 5194 events. 2995/5194 cut-off events. For 2139/2392 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 31712 event pairs, 2079 based on Foata normal form. 0/4136 useless extension candidates. Maximal degree in co-relation 11595. Up to 3246 conditions per place. [2025-03-04 15:31:28,178 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 111 selfloop transitions, 45 changer transitions 0/197 dead transitions. [2025-03-04 15:31:28,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 197 transitions, 1254 flow [2025-03-04 15:31:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:31:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:31:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 631 transitions. [2025-03-04 15:31:28,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5463203463203463 [2025-03-04 15:31:28,180 INFO L175 Difference]: Start difference. First operand has 136 places, 140 transitions, 717 flow. Second operand 11 states and 631 transitions. [2025-03-04 15:31:28,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 197 transitions, 1254 flow [2025-03-04 15:31:28,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 197 transitions, 1245 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:28,184 INFO L231 Difference]: Finished difference. Result has 147 places, 142 transitions, 820 flow [2025-03-04 15:31:28,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=820, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2025-03-04 15:31:28,184 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 47 predicate places. [2025-03-04 15:31:28,184 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 820 flow [2025-03-04 15:31:28,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 49.06666666666667) internal successors, (736), 15 states have internal predecessors, (736), 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:31:28,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:28,185 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:28,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:28,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 15:31:28,391 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:28,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:28,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1100898770, now seen corresponding path program 1 times [2025-03-04 15:31:28,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:28,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204782303] [2025-03-04 15:31:28,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:28,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:28,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:31:28,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:31:28,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:28,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:31:28,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:28,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204782303] [2025-03-04 15:31:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204782303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:28,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290206341] [2025-03-04 15:31:28,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:28,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:28,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:28,483 INFO L229 MonitoredProcess]: Starting monitored process 12 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:31:28,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:31:28,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 15:31:28,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 15:31:28,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:28,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:28,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:31:28,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:31:28,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:31:28,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290206341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:28,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:28,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 15:31:28,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757756832] [2025-03-04 15:31:28,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:28,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:31:28,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:28,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:31:28,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:31:28,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-04 15:31:28,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 820 flow. Second operand has 15 states, 15 states have (on average 50.0) internal successors, (750), 15 states have internal predecessors, (750), 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:31:28,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:28,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-04 15:31:28,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:29,292 INFO L124 PetriNetUnfolderBase]: 2375/4541 cut-off events. [2025-03-04 15:31:29,292 INFO L125 PetriNetUnfolderBase]: For 1765/1973 co-relation queries the response was YES. [2025-03-04 15:31:29,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9628 conditions, 4541 events. 2375/4541 cut-off events. For 1765/1973 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 31733 event pairs, 1666 based on Foata normal form. 38/3680 useless extension candidates. Maximal degree in co-relation 9579. Up to 2813 conditions per place. [2025-03-04 15:31:29,310 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 101 selfloop transitions, 45 changer transitions 0/188 dead transitions. [2025-03-04 15:31:29,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 188 transitions, 1289 flow [2025-03-04 15:31:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:31:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:31:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 638 transitions. [2025-03-04 15:31:29,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-03-04 15:31:29,312 INFO L175 Difference]: Start difference. First operand has 147 places, 142 transitions, 820 flow. Second operand 11 states and 638 transitions. [2025-03-04 15:31:29,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 188 transitions, 1289 flow [2025-03-04 15:31:29,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 188 transitions, 1205 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 15:31:29,321 INFO L231 Difference]: Finished difference. Result has 151 places, 144 transitions, 846 flow [2025-03-04 15:31:29,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=846, PETRI_PLACES=151, PETRI_TRANSITIONS=144} [2025-03-04 15:31:29,321 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 51 predicate places. [2025-03-04 15:31:29,321 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 846 flow [2025-03-04 15:31:29,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 50.0) internal successors, (750), 15 states have internal predecessors, (750), 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:31:29,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:29,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:29,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 15:31:29,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 15:31:29,522 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:29,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:29,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1320083278, now seen corresponding path program 1 times [2025-03-04 15:31:29,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:29,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491334859] [2025-03-04 15:31:29,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:29,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:29,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:31:29,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:31:29,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:29,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:31:29,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:29,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491334859] [2025-03-04 15:31:29,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491334859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:29,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:29,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:31:29,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918620342] [2025-03-04 15:31:29,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:29,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:31:29,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:29,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:31:29,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:31:29,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 105 [2025-03-04 15:31:29,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 846 flow. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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:31:29,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:29,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 105 [2025-03-04 15:31:29,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:30,380 INFO L124 PetriNetUnfolderBase]: 5436/9302 cut-off events. [2025-03-04 15:31:30,380 INFO L125 PetriNetUnfolderBase]: For 6458/6803 co-relation queries the response was YES. [2025-03-04 15:31:30,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21941 conditions, 9302 events. 5436/9302 cut-off events. For 6458/6803 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 63457 event pairs, 2711 based on Foata normal form. 153/7629 useless extension candidates. Maximal degree in co-relation 21856. Up to 4812 conditions per place. [2025-03-04 15:31:30,435 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 164 selfloop transitions, 3 changer transitions 0/206 dead transitions. [2025-03-04 15:31:30,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 206 transitions, 1423 flow [2025-03-04 15:31:30,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 302 transitions. [2025-03-04 15:31:30,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.719047619047619 [2025-03-04 15:31:30,438 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 846 flow. Second operand 4 states and 302 transitions. [2025-03-04 15:31:30,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 206 transitions, 1423 flow [2025-03-04 15:31:30,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 206 transitions, 1339 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 15:31:30,450 INFO L231 Difference]: Finished difference. Result has 148 places, 146 transitions, 784 flow [2025-03-04 15:31:30,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=784, PETRI_PLACES=148, PETRI_TRANSITIONS=146} [2025-03-04 15:31:30,450 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 48 predicate places. [2025-03-04 15:31:30,450 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 146 transitions, 784 flow [2025-03-04 15:31:30,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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:31:30,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:30,450 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:30,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:31:30,451 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:30,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:30,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1391112247, now seen corresponding path program 2 times [2025-03-04 15:31:30,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:30,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247320562] [2025-03-04 15:31:30,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:30,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:30,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 15:31:30,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:31:30,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:31:30,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:31:30,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:30,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247320562] [2025-03-04 15:31:30,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247320562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:30,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752796065] [2025-03-04 15:31:30,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:30,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:30,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:30,931 INFO L229 MonitoredProcess]: Starting monitored process 13 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:31:30,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:31:31,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 15:31:31,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:31:31,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:31:31,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:31,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 15:31:31,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:31,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:31:31,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 15:31:31,137 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:31:31,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:31:31,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 15:31:31,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-04 15:31:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 15:31:31,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:31,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:31,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-04 15:31:31,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:31,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2025-03-04 15:31:31,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 15:31:31,481 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:31:31,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752796065] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:31,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:31,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2025-03-04 15:31:31,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145880264] [2025-03-04 15:31:31,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:31,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:31:31,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:31,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:31:31,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=475, Unknown=1, NotChecked=0, Total=552 [2025-03-04 15:31:31,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-03-04 15:31:31,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 146 transitions, 784 flow. Second operand has 24 states, 24 states have (on average 46.208333333333336) internal successors, (1109), 24 states have internal predecessors, (1109), 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:31:31,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:31,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-03-04 15:31:31,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:33,172 INFO L124 PetriNetUnfolderBase]: 7283/11664 cut-off events. [2025-03-04 15:31:33,172 INFO L125 PetriNetUnfolderBase]: For 9845/11074 co-relation queries the response was YES. [2025-03-04 15:31:33,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30073 conditions, 11664 events. 7283/11664 cut-off events. For 9845/11074 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 75978 event pairs, 1863 based on Foata normal form. 237/9680 useless extension candidates. Maximal degree in co-relation 29952. Up to 3441 conditions per place. [2025-03-04 15:31:33,215 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 170 selfloop transitions, 43 changer transitions 0/251 dead transitions. [2025-03-04 15:31:33,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 251 transitions, 1631 flow [2025-03-04 15:31:33,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:31:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 15:31:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 844 transitions. [2025-03-04 15:31:33,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5023809523809524 [2025-03-04 15:31:33,217 INFO L175 Difference]: Start difference. First operand has 148 places, 146 transitions, 784 flow. Second operand 16 states and 844 transitions. [2025-03-04 15:31:33,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 251 transitions, 1631 flow [2025-03-04 15:31:33,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 251 transitions, 1621 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:33,228 INFO L231 Difference]: Finished difference. Result has 164 places, 154 transitions, 931 flow [2025-03-04 15:31:33,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=931, PETRI_PLACES=164, PETRI_TRANSITIONS=154} [2025-03-04 15:31:33,229 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 64 predicate places. [2025-03-04 15:31:33,229 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 154 transitions, 931 flow [2025-03-04 15:31:33,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 46.208333333333336) internal successors, (1109), 24 states have internal predecessors, (1109), 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:31:33,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:33,230 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:33,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:33,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:33,435 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:33,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1391112246, now seen corresponding path program 1 times [2025-03-04 15:31:33,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:33,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884893669] [2025-03-04 15:31:33,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:33,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:33,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:31:33,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:31:33,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:33,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:31:33,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:33,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884893669] [2025-03-04 15:31:33,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884893669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:33,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163247780] [2025-03-04 15:31:33,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:33,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:33,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:33,966 INFO L229 MonitoredProcess]: Starting monitored process 14 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:31:33,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:31:34,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:31:34,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:31:34,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:34,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:34,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 15:31:34,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:34,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:31:34,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 15:31:34,147 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:31:34,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:31:34,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:31:34,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:31:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:31:34,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:34,290 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_418 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_418) c_~B~0.base) (+ 4 c_~B~0.offset)) 4294967296)) is different from false [2025-03-04 15:31:34,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:34,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-04 15:31:34,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:34,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2025-03-04 15:31:34,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:31:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2025-03-04 15:31:34,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163247780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:34,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:34,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 27 [2025-03-04 15:31:34,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672317380] [2025-03-04 15:31:34,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:34,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 15:31:34,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:34,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 15:31:34,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=620, Unknown=1, NotChecked=50, Total=756 [2025-03-04 15:31:34,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-04 15:31:34,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 154 transitions, 931 flow. Second operand has 28 states, 28 states have (on average 44.964285714285715) internal successors, (1259), 28 states have internal predecessors, (1259), 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:31:34,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:34,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-04 15:31:34,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:36,517 INFO L124 PetriNetUnfolderBase]: 7964/12739 cut-off events. [2025-03-04 15:31:36,517 INFO L125 PetriNetUnfolderBase]: For 12056/13199 co-relation queries the response was YES. [2025-03-04 15:31:36,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35549 conditions, 12739 events. 7964/12739 cut-off events. For 12056/13199 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 81094 event pairs, 1997 based on Foata normal form. 174/10410 useless extension candidates. Maximal degree in co-relation 35460. Up to 3885 conditions per place. [2025-03-04 15:31:36,598 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 153 selfloop transitions, 39 changer transitions 0/229 dead transitions. [2025-03-04 15:31:36,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 229 transitions, 1560 flow [2025-03-04 15:31:36,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 15:31:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 15:31:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 946 transitions. [2025-03-04 15:31:36,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4741854636591479 [2025-03-04 15:31:36,599 INFO L175 Difference]: Start difference. First operand has 164 places, 154 transitions, 931 flow. Second operand 19 states and 946 transitions. [2025-03-04 15:31:36,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 229 transitions, 1560 flow [2025-03-04 15:31:36,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 229 transitions, 1525 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:31:36,618 INFO L231 Difference]: Finished difference. Result has 177 places, 149 transitions, 920 flow [2025-03-04 15:31:36,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=920, PETRI_PLACES=177, PETRI_TRANSITIONS=149} [2025-03-04 15:31:36,618 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 77 predicate places. [2025-03-04 15:31:36,618 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 149 transitions, 920 flow [2025-03-04 15:31:36,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 44.964285714285715) internal successors, (1259), 28 states have internal predecessors, (1259), 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:31:36,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:36,619 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:36,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 15:31:36,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-04 15:31:36,819 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:36,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1391112243, now seen corresponding path program 1 times [2025-03-04 15:31:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:36,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133051722] [2025-03-04 15:31:36,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:36,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:36,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:31:36,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:31:36,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:36,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:31:37,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:37,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133051722] [2025-03-04 15:31:37,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133051722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:37,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132275799] [2025-03-04 15:31:37,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:37,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:37,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:37,317 INFO L229 MonitoredProcess]: Starting monitored process 15 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:31:37,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 15:31:37,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:31:37,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:31:37,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:37,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:37,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 15:31:37,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:37,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:31:37,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:31:37,505 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:31:37,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:31:37,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 15:31:37,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 15:31:37,599 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 15:31:37,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 15:31:37,684 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-04 15:31:37,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-03-04 15:31:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:31:37,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:37,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:37,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-03-04 15:31:37,892 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int))) (or (< 2147483647 (select v_arrayElimArr_7 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_7) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648))) is different from false [2025-03-04 15:31:37,901 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int))) (or (< 2147483647 (select v_arrayElimArr_7 4)) (< (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_7) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648))) is different from false [2025-03-04 15:31:37,921 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_203| Int)) (or (< 2147483647 (select v_arrayElimArr_7 4)) (< (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_458) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_203| v_arrayElimArr_7) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648))) is different from false [2025-03-04 15:31:38,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:38,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-03-04 15:31:38,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:38,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 129 [2025-03-04 15:31:38,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2025-03-04 15:31:38,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:38,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2025-03-04 15:31:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-04 15:31:38,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132275799] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:38,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:38,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 23 [2025-03-04 15:31:38,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152985927] [2025-03-04 15:31:38,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:38,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 15:31:38,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:38,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 15:31:38,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=389, Unknown=4, NotChecked=126, Total=600 [2025-03-04 15:31:38,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-03-04 15:31:38,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 149 transitions, 920 flow. Second operand has 25 states, 25 states have (on average 45.96) internal successors, (1149), 25 states have internal predecessors, (1149), 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:31:38,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:38,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-03-04 15:31:38,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:39,869 INFO L124 PetriNetUnfolderBase]: 6302/10369 cut-off events. [2025-03-04 15:31:39,869 INFO L125 PetriNetUnfolderBase]: For 10490/11410 co-relation queries the response was YES. [2025-03-04 15:31:39,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29746 conditions, 10369 events. 6302/10369 cut-off events. For 10490/11410 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 67415 event pairs, 3160 based on Foata normal form. 159/9108 useless extension candidates. Maximal degree in co-relation 29658. Up to 5276 conditions per place. [2025-03-04 15:31:39,925 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 154 selfloop transitions, 33 changer transitions 0/225 dead transitions. [2025-03-04 15:31:39,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 225 transitions, 1583 flow [2025-03-04 15:31:39,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:31:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:31:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 786 transitions. [2025-03-04 15:31:39,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4990476190476191 [2025-03-04 15:31:39,927 INFO L175 Difference]: Start difference. First operand has 177 places, 149 transitions, 920 flow. Second operand 15 states and 786 transitions. [2025-03-04 15:31:39,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 225 transitions, 1583 flow [2025-03-04 15:31:39,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 225 transitions, 1488 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-04 15:31:39,940 INFO L231 Difference]: Finished difference. Result has 173 places, 148 transitions, 887 flow [2025-03-04 15:31:39,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=887, PETRI_PLACES=173, PETRI_TRANSITIONS=148} [2025-03-04 15:31:39,941 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 73 predicate places. [2025-03-04 15:31:39,941 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 148 transitions, 887 flow [2025-03-04 15:31:39,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 45.96) internal successors, (1149), 25 states have internal predecessors, (1149), 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:31:39,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:39,941 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:39,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:40,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:40,142 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:40,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:40,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1391112244, now seen corresponding path program 1 times [2025-03-04 15:31:40,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:40,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119295273] [2025-03-04 15:31:40,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:40,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:40,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:31:40,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:31:40,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:40,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:31:40,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:40,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119295273] [2025-03-04 15:31:40,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119295273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:40,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960188514] [2025-03-04 15:31:40,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:40,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:40,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:40,516 INFO L229 MonitoredProcess]: Starting monitored process 16 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:31:40,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 15:31:40,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:31:40,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:31:40,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:40,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:40,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 15:31:40,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:40,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:31:40,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:31:40,693 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 15:31:40,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 15:31:40,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:31:40,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 15:31:40,757 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 15:31:40,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-03-04 15:31:40,836 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-04 15:31:40,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-04 15:31:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:31:40,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:41,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:41,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2025-03-04 15:31:41,035 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (or (< (+ (select v_arrayElimArr_9 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648) 0) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_9) c_~A~0.base) (+ c_~A~0.offset 4)))))) is different from false [2025-03-04 15:31:41,044 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (or (< (+ (select v_arrayElimArr_9 4) 2147483648) 0) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_9) c_~A~0.base) (+ c_~A~0.offset 4)))))) is different from false [2025-03-04 15:31:41,061 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_207| Int) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (or (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_500) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_207| v_arrayElimArr_9) c_~A~0.base) (+ c_~A~0.offset 4)))) (< (+ (select v_arrayElimArr_9 4) 2147483648) 0))) is different from false [2025-03-04 15:31:41,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:41,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-03-04 15:31:41,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:41,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 75 [2025-03-04 15:31:41,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:31:41,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 67 [2025-03-04 15:31:41,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-03-04 15:31:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-04 15:31:41,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960188514] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:41,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:41,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 27 [2025-03-04 15:31:41,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486708121] [2025-03-04 15:31:41,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:41,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 15:31:41,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:41,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 15:31:41,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=562, Unknown=3, NotChecked=150, Total=812 [2025-03-04 15:31:41,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-03-04 15:31:41,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 148 transitions, 887 flow. Second operand has 29 states, 29 states have (on average 45.827586206896555) internal successors, (1329), 29 states have internal predecessors, (1329), 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:31:41,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:41,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-03-04 15:31:41,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:42,758 INFO L124 PetriNetUnfolderBase]: 5970/9925 cut-off events. [2025-03-04 15:31:42,758 INFO L125 PetriNetUnfolderBase]: For 10538/11463 co-relation queries the response was YES. [2025-03-04 15:31:42,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28045 conditions, 9925 events. 5970/9925 cut-off events. For 10538/11463 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 64469 event pairs, 3317 based on Foata normal form. 146/8926 useless extension candidates. Maximal degree in co-relation 27957. Up to 5276 conditions per place. [2025-03-04 15:31:42,813 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 153 selfloop transitions, 33 changer transitions 0/224 dead transitions. [2025-03-04 15:31:42,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 224 transitions, 1548 flow [2025-03-04 15:31:42,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:31:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:31:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 785 transitions. [2025-03-04 15:31:42,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4984126984126984 [2025-03-04 15:31:42,816 INFO L175 Difference]: Start difference. First operand has 173 places, 148 transitions, 887 flow. Second operand 15 states and 785 transitions. [2025-03-04 15:31:42,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 224 transitions, 1548 flow [2025-03-04 15:31:42,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 224 transitions, 1489 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-03-04 15:31:42,830 INFO L231 Difference]: Finished difference. Result has 177 places, 147 transitions, 890 flow [2025-03-04 15:31:42,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=890, PETRI_PLACES=177, PETRI_TRANSITIONS=147} [2025-03-04 15:31:42,830 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 77 predicate places. [2025-03-04 15:31:42,830 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 147 transitions, 890 flow [2025-03-04 15:31:42,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 45.827586206896555) internal successors, (1329), 29 states have internal predecessors, (1329), 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:31:42,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:42,831 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:42,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 15:31:43,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:43,031 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:43,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:43,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1194654496, now seen corresponding path program 2 times [2025-03-04 15:31:43,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:43,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049821969] [2025-03-04 15:31:43,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:43,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:43,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-04 15:31:43,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:31:43,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:31:43,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:43,086 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:31:43,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:43,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049821969] [2025-03-04 15:31:43,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049821969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:43,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:43,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:43,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96360419] [2025-03-04 15:31:43,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:43,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:43,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:43,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:43,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:31:43,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 105 [2025-03-04 15:31:43,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 147 transitions, 890 flow. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 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:31:43,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:43,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 105 [2025-03-04 15:31:43,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:43,911 INFO L124 PetriNetUnfolderBase]: 6404/10307 cut-off events. [2025-03-04 15:31:43,911 INFO L125 PetriNetUnfolderBase]: For 12864/13591 co-relation queries the response was YES. [2025-03-04 15:31:43,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30476 conditions, 10307 events. 6404/10307 cut-off events. For 12864/13591 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 66669 event pairs, 1340 based on Foata normal form. 422/9364 useless extension candidates. Maximal degree in co-relation 30388. Up to 4260 conditions per place. [2025-03-04 15:31:43,961 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 147 selfloop transitions, 9 changer transitions 0/196 dead transitions. [2025-03-04 15:31:43,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 196 transitions, 1444 flow [2025-03-04 15:31:43,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:43,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2025-03-04 15:31:43,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2025-03-04 15:31:43,962 INFO L175 Difference]: Start difference. First operand has 177 places, 147 transitions, 890 flow. Second operand 4 states and 295 transitions. [2025-03-04 15:31:43,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 196 transitions, 1444 flow [2025-03-04 15:31:43,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 196 transitions, 1365 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-03-04 15:31:43,972 INFO L231 Difference]: Finished difference. Result has 166 places, 146 transitions, 839 flow [2025-03-04 15:31:43,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=839, PETRI_PLACES=166, PETRI_TRANSITIONS=146} [2025-03-04 15:31:43,973 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 66 predicate places. [2025-03-04 15:31:43,973 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 146 transitions, 839 flow [2025-03-04 15:31:43,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 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:31:43,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:43,973 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:43,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:31:43,973 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:43,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:43,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1124003822, now seen corresponding path program 1 times [2025-03-04 15:31:43,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:43,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156584452] [2025-03-04 15:31:43,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:43,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:43,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 15:31:43,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:31:43,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:43,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:31:44,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:44,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156584452] [2025-03-04 15:31:44,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156584452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:44,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:44,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:31:44,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179996685] [2025-03-04 15:31:44,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:44,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:31:44,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:44,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:31:44,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:31:44,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 105 [2025-03-04 15:31:44,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 146 transitions, 839 flow. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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:31:44,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:44,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 105 [2025-03-04 15:31:44,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:44,779 INFO L124 PetriNetUnfolderBase]: 5944/10568 cut-off events. [2025-03-04 15:31:44,779 INFO L125 PetriNetUnfolderBase]: For 15459/15761 co-relation queries the response was YES. [2025-03-04 15:31:44,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31280 conditions, 10568 events. 5944/10568 cut-off events. For 15459/15761 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 74571 event pairs, 3340 based on Foata normal form. 291/9822 useless extension candidates. Maximal degree in co-relation 31192. Up to 6659 conditions per place. [2025-03-04 15:31:44,854 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 138 selfloop transitions, 6 changer transitions 0/183 dead transitions. [2025-03-04 15:31:44,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 183 transitions, 1305 flow [2025-03-04 15:31:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 287 transitions. [2025-03-04 15:31:44,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-04 15:31:44,855 INFO L175 Difference]: Start difference. First operand has 166 places, 146 transitions, 839 flow. Second operand 4 states and 287 transitions. [2025-03-04 15:31:44,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 183 transitions, 1305 flow [2025-03-04 15:31:44,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 183 transitions, 1255 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:31:44,871 INFO L231 Difference]: Finished difference. Result has 168 places, 147 transitions, 848 flow [2025-03-04 15:31:44,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=848, PETRI_PLACES=168, PETRI_TRANSITIONS=147} [2025-03-04 15:31:44,872 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 68 predicate places. [2025-03-04 15:31:44,872 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 147 transitions, 848 flow [2025-03-04 15:31:44,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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:31:44,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:44,872 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:44,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 15:31:44,872 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:44,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:44,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1620415403, now seen corresponding path program 1 times [2025-03-04 15:31:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:44,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429180298] [2025-03-04 15:31:44,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:44,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 15:31:44,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:31:44,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:44,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 15:31:44,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:44,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429180298] [2025-03-04 15:31:44,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429180298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:44,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932313993] [2025-03-04 15:31:44,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:44,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:44,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:44,928 INFO L229 MonitoredProcess]: Starting monitored process 17 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:31:44,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 15:31:45,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 15:31:45,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 15:31:45,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:45,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:45,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:31:45,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 15:31:45,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 15:31:45,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932313993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:45,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:45,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 23 [2025-03-04 15:31:45,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401475727] [2025-03-04 15:31:45,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:45,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 15:31:45,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:45,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 15:31:45,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:31:45,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 105 [2025-03-04 15:31:45,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 147 transitions, 848 flow. Second operand has 23 states, 23 states have (on average 48.17391304347826) internal successors, (1108), 23 states have internal predecessors, (1108), 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:31:45,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:45,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 105 [2025-03-04 15:31:45,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:47,447 INFO L124 PetriNetUnfolderBase]: 10024/16294 cut-off events. [2025-03-04 15:31:47,447 INFO L125 PetriNetUnfolderBase]: For 18865/19958 co-relation queries the response was YES. [2025-03-04 15:31:47,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49440 conditions, 16294 events. 10024/16294 cut-off events. For 18865/19958 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 112315 event pairs, 3981 based on Foata normal form. 230/14286 useless extension candidates. Maximal degree in co-relation 49316. Up to 4652 conditions per place. [2025-03-04 15:31:47,538 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 285 selfloop transitions, 70 changer transitions 0/397 dead transitions. [2025-03-04 15:31:47,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 397 transitions, 2906 flow [2025-03-04 15:31:47,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 15:31:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 15:31:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1246 transitions. [2025-03-04 15:31:47,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5650793650793651 [2025-03-04 15:31:47,539 INFO L175 Difference]: Start difference. First operand has 168 places, 147 transitions, 848 flow. Second operand 21 states and 1246 transitions. [2025-03-04 15:31:47,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 397 transitions, 2906 flow [2025-03-04 15:31:47,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 397 transitions, 2875 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:47,607 INFO L231 Difference]: Finished difference. Result has 192 places, 177 transitions, 1265 flow [2025-03-04 15:31:47,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1265, PETRI_PLACES=192, PETRI_TRANSITIONS=177} [2025-03-04 15:31:47,608 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 92 predicate places. [2025-03-04 15:31:47,608 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 177 transitions, 1265 flow [2025-03-04 15:31:47,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 48.17391304347826) internal successors, (1108), 23 states have internal predecessors, (1108), 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:31:47,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:47,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:47,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 15:31:47,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 15:31:47,809 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:47,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash -355097955, now seen corresponding path program 1 times [2025-03-04 15:31:47,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:47,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390315715] [2025-03-04 15:31:47,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:47,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:31:47,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:31:47,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:47,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:31:47,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:47,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390315715] [2025-03-04 15:31:47,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390315715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:47,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:47,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:31:47,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973653931] [2025-03-04 15:31:47,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:47,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:47,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:47,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:47,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-04 15:31:47,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 177 transitions, 1265 flow. Second operand has 6 states, 6 states have (on average 47.333333333333336) internal successors, (284), 6 states have internal predecessors, (284), 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:31:47,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:47,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-04 15:31:47,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:50,854 INFO L124 PetriNetUnfolderBase]: 18645/30768 cut-off events. [2025-03-04 15:31:50,854 INFO L125 PetriNetUnfolderBase]: For 53037/55524 co-relation queries the response was YES. [2025-03-04 15:31:51,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103687 conditions, 30768 events. 18645/30768 cut-off events. For 53037/55524 co-relation queries the response was YES. Maximal size of possible extension queue 900. Compared 236530 event pairs, 14760 based on Foata normal form. 653/28913 useless extension candidates. Maximal degree in co-relation 103547. Up to 12944 conditions per place. [2025-03-04 15:31:51,169 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 179 selfloop transitions, 14 changer transitions 0/229 dead transitions. [2025-03-04 15:31:51,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 229 transitions, 1956 flow [2025-03-04 15:31:51,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:31:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:31:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 303 transitions. [2025-03-04 15:31:51,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5771428571428572 [2025-03-04 15:31:51,170 INFO L175 Difference]: Start difference. First operand has 192 places, 177 transitions, 1265 flow. Second operand 5 states and 303 transitions. [2025-03-04 15:31:51,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 229 transitions, 1956 flow [2025-03-04 15:31:51,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 229 transitions, 1893 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-03-04 15:31:51,604 INFO L231 Difference]: Finished difference. Result has 194 places, 179 transitions, 1282 flow [2025-03-04 15:31:51,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1282, PETRI_PLACES=194, PETRI_TRANSITIONS=179} [2025-03-04 15:31:51,605 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 94 predicate places. [2025-03-04 15:31:51,605 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 179 transitions, 1282 flow [2025-03-04 15:31:51,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.333333333333336) internal successors, (284), 6 states have internal predecessors, (284), 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:31:51,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:51,605 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:51,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 15:31:51,605 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:51,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:51,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1631924392, now seen corresponding path program 1 times [2025-03-04 15:31:51,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:51,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640305340] [2025-03-04 15:31:51,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:51,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:51,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:31:51,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:31:51,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:51,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 15:31:51,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:51,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640305340] [2025-03-04 15:31:51,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640305340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:51,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982492945] [2025-03-04 15:31:51,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:51,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:51,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:51,908 INFO L229 MonitoredProcess]: Starting monitored process 18 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:31:51,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 15:31:51,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:31:52,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:31:52,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:52,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:52,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:31:52,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 15:31:52,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 15:31:52,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982492945] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:52,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:52,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-04 15:31:52,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297963281] [2025-03-04 15:31:52,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:52,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 15:31:52,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:52,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:31:52,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:31:52,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-03-04 15:31:52,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 179 transitions, 1282 flow. Second operand has 26 states, 26 states have (on average 45.84615384615385) internal successors, (1192), 26 states have internal predecessors, (1192), 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:31:52,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:52,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-03-04 15:31:52,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:56,128 INFO L124 PetriNetUnfolderBase]: 23265/37046 cut-off events. [2025-03-04 15:31:56,128 INFO L125 PetriNetUnfolderBase]: For 54095/56001 co-relation queries the response was YES. [2025-03-04 15:31:56,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114723 conditions, 37046 events. 23265/37046 cut-off events. For 54095/56001 co-relation queries the response was YES. Maximal size of possible extension queue 960. Compared 272753 event pairs, 16582 based on Foata normal form. 796/35514 useless extension candidates. Maximal degree in co-relation 114542. Up to 25644 conditions per place. [2025-03-04 15:31:56,453 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 159 selfloop transitions, 75 changer transitions 0/272 dead transitions. [2025-03-04 15:31:56,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 272 transitions, 2221 flow [2025-03-04 15:31:56,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:31:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:31:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 911 transitions. [2025-03-04 15:31:56,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5103641456582633 [2025-03-04 15:31:56,455 INFO L175 Difference]: Start difference. First operand has 194 places, 179 transitions, 1282 flow. Second operand 17 states and 911 transitions. [2025-03-04 15:31:56,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 272 transitions, 2221 flow [2025-03-04 15:31:56,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 272 transitions, 2213 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:56,597 INFO L231 Difference]: Finished difference. Result has 214 places, 188 transitions, 1577 flow [2025-03-04 15:31:56,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1577, PETRI_PLACES=214, PETRI_TRANSITIONS=188} [2025-03-04 15:31:56,598 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 114 predicate places. [2025-03-04 15:31:56,598 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 188 transitions, 1577 flow [2025-03-04 15:31:56,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 45.84615384615385) internal successors, (1192), 26 states have internal predecessors, (1192), 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:31:56,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:56,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:56,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 15:31:56,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 15:31:56,799 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:31:56,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash 937792205, now seen corresponding path program 1 times [2025-03-04 15:31:56,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:56,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233633188] [2025-03-04 15:31:56,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:56,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:56,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:31:56,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:31:56,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:56,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:31:56,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:56,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233633188] [2025-03-04 15:31:56,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233633188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:56,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:56,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:31:56,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65457906] [2025-03-04 15:31:56,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:56,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:31:56,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:56,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:31:56,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:31:56,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-04 15:31:56,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 188 transitions, 1577 flow. Second operand has 7 states, 7 states have (on average 46.714285714285715) internal successors, (327), 7 states have internal predecessors, (327), 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:31:56,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:56,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-04 15:31:56,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:00,320 INFO L124 PetriNetUnfolderBase]: 20148/34221 cut-off events. [2025-03-04 15:32:00,320 INFO L125 PetriNetUnfolderBase]: For 69727/72833 co-relation queries the response was YES. [2025-03-04 15:32:00,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114622 conditions, 34221 events. 20148/34221 cut-off events. For 69727/72833 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 276633 event pairs, 7776 based on Foata normal form. 798/32773 useless extension candidates. Maximal degree in co-relation 114405. Up to 19584 conditions per place. [2025-03-04 15:32:00,596 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 178 selfloop transitions, 28 changer transitions 0/242 dead transitions. [2025-03-04 15:32:00,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 242 transitions, 2322 flow [2025-03-04 15:32:00,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 344 transitions. [2025-03-04 15:32:00,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546031746031746 [2025-03-04 15:32:00,597 INFO L175 Difference]: Start difference. First operand has 214 places, 188 transitions, 1577 flow. Second operand 6 states and 344 transitions. [2025-03-04 15:32:00,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 242 transitions, 2322 flow [2025-03-04 15:32:00,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 242 transitions, 2123 flow, removed 12 selfloop flow, removed 13 redundant places. [2025-03-04 15:32:00,915 INFO L231 Difference]: Finished difference. Result has 210 places, 198 transitions, 1564 flow [2025-03-04 15:32:00,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1564, PETRI_PLACES=210, PETRI_TRANSITIONS=198} [2025-03-04 15:32:00,915 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 110 predicate places. [2025-03-04 15:32:00,915 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 198 transitions, 1564 flow [2025-03-04 15:32:00,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.714285714285715) internal successors, (327), 7 states have internal predecessors, (327), 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:32:00,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:00,916 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:00,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 15:32:00,916 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-04 15:32:00,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:00,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1437566766, now seen corresponding path program 1 times [2025-03-04 15:32:00,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:00,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221437836] [2025-03-04 15:32:00,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:00,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:00,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:32:00,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:32:00,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:00,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:32:00,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:00,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221437836] [2025-03-04 15:32:00,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221437836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:32:00,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436791072] [2025-03-04 15:32:00,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:00,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:32:00,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:32:00,994 INFO L229 MonitoredProcess]: Starting monitored process 19 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:32:00,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 15:32:01,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 15:32:01,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 15:32:01,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:01,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:01,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:32:01,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:32:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:32:01,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:32:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:32:01,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436791072] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:32:01,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:32:01,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-04 15:32:01,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859010972] [2025-03-04 15:32:01,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:32:01,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:32:01,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:01,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:32:01,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:32:01,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 105 [2025-03-04 15:32:01,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 198 transitions, 1564 flow. Second operand has 15 states, 15 states have (on average 49.4) internal successors, (741), 15 states have internal predecessors, (741), 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:32:01,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:01,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 105 [2025-03-04 15:32:01,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand