./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.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/chl-chromosome-opt-symm.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 b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:23:52,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:23:52,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:23:52,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:23:52,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:23:52,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:23:52,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:23:52,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:23:52,220 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:23:52,220 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:23:52,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:23:52,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:23:52,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:23:52,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:23:52,221 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:23:52,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:23:52,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:23:52,221 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:23:52,222 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:23:52,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:23:52,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:23:52,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:23:52,223 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:23:52,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:23:52,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:23:52,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:23:52,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:23:52,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:23:52,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:23:52,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:23:52,223 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 -> b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a [2025-03-04 15:23:52,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:23:52,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:23:52,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:23:52,505 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:23:52,505 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:23:52,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-03-04 15:23:53,683 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0f24d5d/2e00a55d1fbe40da9f8dd7900159c582/FLAG3991ecf3e [2025-03-04 15:23:53,923 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:23:53,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-03-04 15:23:53,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0f24d5d/2e00a55d1fbe40da9f8dd7900159c582/FLAG3991ecf3e [2025-03-04 15:23:54,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0f24d5d/2e00a55d1fbe40da9f8dd7900159c582 [2025-03-04 15:23:54,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:23:54,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:23:54,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:23:54,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:23:54,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:23:54,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:23:54" (1/1) ... [2025-03-04 15:23:54,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a059847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:54, skipping insertion in model container [2025-03-04 15:23:54,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:23:54" (1/1) ... [2025-03-04 15:23:54,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:23:54,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:23:54,415 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:23:54,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:23:54,442 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:23:54,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:54 WrapperNode [2025-03-04 15:23:54,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:23:54,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:23:54,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:23:54,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:23:54,449 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:23:54" (1/1) ... [2025-03-04 15:23:54,455 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:23:54" (1/1) ... [2025-03-04 15:23:54,475 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 169 [2025-03-04 15:23:54,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:23:54,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:23:54,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:23:54,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:23:54,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:54" (1/1) ... [2025-03-04 15:23:54,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:54" (1/1) ... [2025-03-04 15:23:54,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:54" (1/1) ... [2025-03-04 15:23:54,496 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 15:23:54,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:54" (1/1) ... [2025-03-04 15:23:54,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:54" (1/1) ... [2025-03-04 15:23:54,501 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:54" (1/1) ... [2025-03-04 15:23:54,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:54" (1/1) ... [2025-03-04 15:23:54,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:54" (1/1) ... [2025-03-04 15:23:54,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:54" (1/1) ... [2025-03-04 15:23:54,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:23:54,506 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:23:54,506 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:23:54,506 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:23:54,507 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:54" (1/1) ... [2025-03-04 15:23:54,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:23:54,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:54,532 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:23:54,534 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:23:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:23:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:23:54,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:23:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:23:54,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:23:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:23:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:23:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:23:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:23:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:23:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:23:54,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:23:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:23:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:23:54,551 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:23:54,628 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:23:54,629 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:23:54,885 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:23:54,885 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:23:55,047 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:23:55,047 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:23:55,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:55 BoogieIcfgContainer [2025-03-04 15:23:55,048 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:23:55,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:23:55,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:23:55,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:23:55,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:23:54" (1/3) ... [2025-03-04 15:23:55,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3feb5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:23:55, skipping insertion in model container [2025-03-04 15:23:55,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:23:54" (2/3) ... [2025-03-04 15:23:55,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3feb5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:23:55, skipping insertion in model container [2025-03-04 15:23:55,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:55" (3/3) ... [2025-03-04 15:23:55,055 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2025-03-04 15:23:55,065 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:23:55,066 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-opt-symm.wvr.c that has 3 procedures, 40 locations, 1 initial locations, 4 loop locations, and 10 error locations. [2025-03-04 15:23:55,066 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:23:55,113 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:23:55,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 104 flow [2025-03-04 15:23:55,191 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2025-03-04 15:23:55,193 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:23:55,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 43 events. 6/43 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-03-04 15:23:55,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 45 transitions, 104 flow [2025-03-04 15:23:55,200 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 42 transitions, 96 flow [2025-03-04 15:23:55,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:23:55,220 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;@72a24103, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:23:55,220 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-04 15:23:55,222 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:23:55,223 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:23:55,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:23:55,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:55,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:23:55,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:23:55,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:55,232 INFO L85 PathProgramCache]: Analyzing trace with hash 467141, now seen corresponding path program 1 times [2025-03-04 15:23:55,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:55,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642071772] [2025-03-04 15:23:55,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:55,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:55,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:23:55,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:23:55,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:55,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:55,437 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:23:55,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:55,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642071772] [2025-03-04 15:23:55,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642071772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:55,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:55,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:55,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766439001] [2025-03-04 15:23:55,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:55,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:55,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:55,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:55,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:55,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-04 15:23:55,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:23:55,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:55,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-04 15:23:55,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:55,613 INFO L124 PetriNetUnfolderBase]: 144/300 cut-off events. [2025-03-04 15:23:55,613 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 15:23:55,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 300 events. 144/300 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1233 event pairs, 88 based on Foata normal form. 2/245 useless extension candidates. Maximal degree in co-relation 482. Up to 237 conditions per place. [2025-03-04 15:23:55,617 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 28 selfloop transitions, 7 changer transitions 0/48 dead transitions. [2025-03-04 15:23:55,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 178 flow [2025-03-04 15:23:55,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-03-04 15:23:55,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-03-04 15:23:55,628 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 96 flow. Second operand 4 states and 99 transitions. [2025-03-04 15:23:55,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 178 flow [2025-03-04 15:23:55,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 170 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:23:55,636 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 148 flow [2025-03-04 15:23:55,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2025-03-04 15:23:55,643 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2025-03-04 15:23:55,644 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 148 flow [2025-03-04 15:23:55,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:23:55,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:55,645 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:23:55,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:23:55,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:23:55,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:55,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1032082060, now seen corresponding path program 1 times [2025-03-04 15:23:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:55,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442469626] [2025-03-04 15:23:55,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:55,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:55,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:23:55,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:23:55,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:55,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:55,765 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:23:55,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:55,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442469626] [2025-03-04 15:23:55,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442469626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:55,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370146715] [2025-03-04 15:23:55,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:55,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:55,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:55,770 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:23:55,771 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:23:55,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:23:55,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:23:55,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:55,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:55,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:23:55,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:55,877 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:23:55,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:23:55,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370146715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:55,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:23:55,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:23:55,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183853399] [2025-03-04 15:23:55,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:55,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:23:55,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:55,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:23:55,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:23:55,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-04 15:23:55,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:23:55,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:55,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-04 15:23:55,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:56,097 INFO L124 PetriNetUnfolderBase]: 144/298 cut-off events. [2025-03-04 15:23:56,097 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 15:23:56,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 298 events. 144/298 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1223 event pairs, 88 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 521. Up to 227 conditions per place. [2025-03-04 15:23:56,102 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 21 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2025-03-04 15:23:56,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 206 flow [2025-03-04 15:23:56,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:23:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:23:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2025-03-04 15:23:56,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2025-03-04 15:23:56,104 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 148 flow. Second operand 6 states and 125 transitions. [2025-03-04 15:23:56,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 206 flow [2025-03-04 15:23:56,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:23:56,105 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 164 flow [2025-03-04 15:23:56,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2025-03-04 15:23:56,106 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2025-03-04 15:23:56,106 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 164 flow [2025-03-04 15:23:56,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:23:56,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:56,106 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:23:56,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:23:56,306 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:23:56,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:23:56,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1929773175, now seen corresponding path program 1 times [2025-03-04 15:23:56,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:56,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353498867] [2025-03-04 15:23:56,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:56,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:56,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:23:56,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:23:56,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:56,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:56,399 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:23:56,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:56,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353498867] [2025-03-04 15:23:56,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353498867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:56,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624089063] [2025-03-04 15:23:56,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:56,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:56,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:56,402 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:23:56,404 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:23:56,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:23:56,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:23:56,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:56,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:56,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:23:56,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:56,477 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:23:56,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:56,514 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:23:56,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624089063] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:56,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:56,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:23:56,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760905690] [2025-03-04 15:23:56,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:56,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:23:56,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:56,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:23:56,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:23:56,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-04 15:23:56,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 164 flow. Second operand has 12 states, 12 states have (on average 16.083333333333332) internal successors, (193), 12 states have internal predecessors, (193), 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:23:56,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:56,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-04 15:23:56,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:56,702 INFO L124 PetriNetUnfolderBase]: 150/322 cut-off events. [2025-03-04 15:23:56,702 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-04 15:23:56,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 322 events. 150/322 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1395 event pairs, 88 based on Foata normal form. 6/273 useless extension candidates. Maximal degree in co-relation 523. Up to 238 conditions per place. [2025-03-04 15:23:56,706 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 26 selfloop transitions, 25 changer transitions 0/64 dead transitions. [2025-03-04 15:23:56,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 380 flow [2025-03-04 15:23:56,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:23:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:23:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 207 transitions. [2025-03-04 15:23:56,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46 [2025-03-04 15:23:56,708 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 164 flow. Second operand 10 states and 207 transitions. [2025-03-04 15:23:56,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 380 flow [2025-03-04 15:23:56,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 64 transitions, 322 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 15:23:56,710 INFO L231 Difference]: Finished difference. Result has 55 places, 64 transitions, 304 flow [2025-03-04 15:23:56,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=304, PETRI_PLACES=55, PETRI_TRANSITIONS=64} [2025-03-04 15:23:56,713 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2025-03-04 15:23:56,713 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 64 transitions, 304 flow [2025-03-04 15:23:56,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.083333333333332) internal successors, (193), 12 states have internal predecessors, (193), 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:23:56,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:56,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:56,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:23:56,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 15:23:56,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:23:56,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:56,916 INFO L85 PathProgramCache]: Analyzing trace with hash 775722423, now seen corresponding path program 1 times [2025-03-04 15:23:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:56,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020287010] [2025-03-04 15:23:56,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:56,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:56,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:23:56,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:23:56,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:56,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:56,995 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:23:56,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:56,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020287010] [2025-03-04 15:23:56,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020287010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:56,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:56,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:56,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711207163] [2025-03-04 15:23:56,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:56,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:56,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:56,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:56,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:57,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2025-03-04 15:23:57,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 64 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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:23:57,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:57,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2025-03-04 15:23:57,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:57,127 INFO L124 PetriNetUnfolderBase]: 312/593 cut-off events. [2025-03-04 15:23:57,127 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-03-04 15:23:57,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 593 events. 312/593 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2666 event pairs, 120 based on Foata normal form. 14/523 useless extension candidates. Maximal degree in co-relation 1144. Up to 337 conditions per place. [2025-03-04 15:23:57,130 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 73 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2025-03-04 15:23:57,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 89 transitions, 510 flow [2025-03-04 15:23:57,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2025-03-04 15:23:57,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2025-03-04 15:23:57,135 INFO L175 Difference]: Start difference. First operand has 55 places, 64 transitions, 304 flow. Second operand 4 states and 122 transitions. [2025-03-04 15:23:57,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 89 transitions, 510 flow [2025-03-04 15:23:57,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 486 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:57,138 INFO L231 Difference]: Finished difference. Result has 58 places, 66 transitions, 302 flow [2025-03-04 15:23:57,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=58, PETRI_TRANSITIONS=66} [2025-03-04 15:23:57,139 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2025-03-04 15:23:57,139 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 66 transitions, 302 flow [2025-03-04 15:23:57,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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:23:57,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:57,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:57,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:23:57,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:23:57,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1570147978, now seen corresponding path program 1 times [2025-03-04 15:23:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:57,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492974880] [2025-03-04 15:23:57,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:57,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:23:57,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:23:57,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:57,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:57,198 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:23:57,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:57,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492974880] [2025-03-04 15:23:57,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492974880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:57,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:57,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:23:57,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263217175] [2025-03-04 15:23:57,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:57,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:57,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:57,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:57,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:57,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2025-03-04 15:23:57,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 66 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:23:57,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:57,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2025-03-04 15:23:57,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:57,365 INFO L124 PetriNetUnfolderBase]: 534/997 cut-off events. [2025-03-04 15:23:57,366 INFO L125 PetriNetUnfolderBase]: For 279/305 co-relation queries the response was YES. [2025-03-04 15:23:57,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2141 conditions, 997 events. 534/997 cut-off events. For 279/305 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4912 event pairs, 243 based on Foata normal form. 24/936 useless extension candidates. Maximal degree in co-relation 2074. Up to 577 conditions per place. [2025-03-04 15:23:57,376 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 76 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2025-03-04 15:23:57,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 543 flow [2025-03-04 15:23:57,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-03-04 15:23:57,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6611111111111111 [2025-03-04 15:23:57,377 INFO L175 Difference]: Start difference. First operand has 58 places, 66 transitions, 302 flow. Second operand 4 states and 119 transitions. [2025-03-04 15:23:57,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 543 flow [2025-03-04 15:23:57,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 537 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:23:57,384 INFO L231 Difference]: Finished difference. Result has 62 places, 68 transitions, 322 flow [2025-03-04 15:23:57,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2025-03-04 15:23:57,386 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2025-03-04 15:23:57,386 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 68 transitions, 322 flow [2025-03-04 15:23:57,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:23:57,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:57,387 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:57,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:23:57,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:23:57,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:57,387 INFO L85 PathProgramCache]: Analyzing trace with hash -288963886, now seen corresponding path program 1 times [2025-03-04 15:23:57,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:57,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160504013] [2025-03-04 15:23:57,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:57,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:57,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:23:57,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:23:57,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:57,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:57,465 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:23:57,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:57,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160504013] [2025-03-04 15:23:57,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160504013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:57,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:57,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:57,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773409780] [2025-03-04 15:23:57,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:57,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:57,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:57,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:57,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2025-03-04 15:23:57,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 68 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:57,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:57,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2025-03-04 15:23:57,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:57,598 INFO L124 PetriNetUnfolderBase]: 454/949 cut-off events. [2025-03-04 15:23:57,598 INFO L125 PetriNetUnfolderBase]: For 347/349 co-relation queries the response was YES. [2025-03-04 15:23:57,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 949 events. 454/949 cut-off events. For 347/349 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5009 event pairs, 306 based on Foata normal form. 2/936 useless extension candidates. Maximal degree in co-relation 2088. Up to 725 conditions per place. [2025-03-04 15:23:57,604 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 44 selfloop transitions, 7 changer transitions 0/66 dead transitions. [2025-03-04 15:23:57,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 415 flow [2025-03-04 15:23:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:57,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:57,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-03-04 15:23:57,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2025-03-04 15:23:57,605 INFO L175 Difference]: Start difference. First operand has 62 places, 68 transitions, 322 flow. Second operand 3 states and 88 transitions. [2025-03-04 15:23:57,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 415 flow [2025-03-04 15:23:57,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 66 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:57,609 INFO L231 Difference]: Finished difference. Result has 62 places, 66 transitions, 318 flow [2025-03-04 15:23:57,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=62, PETRI_TRANSITIONS=66} [2025-03-04 15:23:57,611 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2025-03-04 15:23:57,611 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 318 flow [2025-03-04 15:23:57,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:23:57,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:57,611 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:23:57,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:23:57,611 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:23:57,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:57,611 INFO L85 PathProgramCache]: Analyzing trace with hash 372599838, now seen corresponding path program 2 times [2025-03-04 15:23:57,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:57,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847676118] [2025-03-04 15:23:57,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:57,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:57,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:23:57,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:23:57,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:23:57,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:57,645 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:23:57,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:57,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847676118] [2025-03-04 15:23:57,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847676118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:57,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120605052] [2025-03-04 15:23:57,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:57,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:57,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:57,649 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:23:57,650 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:23:57,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:23:57,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:23:57,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:23:57,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:57,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:23:57,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:57,730 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:23:57,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:57,758 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:23:57,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120605052] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:57,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:57,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-04 15:23:57,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295238950] [2025-03-04 15:23:57,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:57,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:23:57,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:57,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:23:57,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:23:57,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-04 15:23:57,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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:23:57,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:57,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-04 15:23:57,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:57,913 INFO L124 PetriNetUnfolderBase]: 448/941 cut-off events. [2025-03-04 15:23:57,913 INFO L125 PetriNetUnfolderBase]: For 311/313 co-relation queries the response was YES. [2025-03-04 15:23:57,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 941 events. 448/941 cut-off events. For 311/313 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4952 event pairs, 300 based on Foata normal form. 2/931 useless extension candidates. Maximal degree in co-relation 2047. Up to 697 conditions per place. [2025-03-04 15:23:57,918 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 26 selfloop transitions, 25 changer transitions 0/64 dead transitions. [2025-03-04 15:23:57,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 400 flow [2025-03-04 15:23:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-04 15:23:57,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-04 15:23:57,918 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 318 flow. Second operand 4 states and 87 transitions. [2025-03-04 15:23:57,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 400 flow [2025-03-04 15:23:57,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 366 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 15:23:57,920 INFO L231 Difference]: Finished difference. Result has 57 places, 64 transitions, 314 flow [2025-03-04 15:23:57,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=57, PETRI_TRANSITIONS=64} [2025-03-04 15:23:57,921 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2025-03-04 15:23:57,921 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 64 transitions, 314 flow [2025-03-04 15:23:57,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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:23:57,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:57,921 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:57,927 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:23:58,121 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:23:58,122 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:23:58,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:58,124 INFO L85 PathProgramCache]: Analyzing trace with hash 998955765, now seen corresponding path program 1 times [2025-03-04 15:23:58,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:58,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783226942] [2025-03-04 15:23:58,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:58,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:58,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:23:58,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:23:58,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:58,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:23:58,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:58,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783226942] [2025-03-04 15:23:58,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783226942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:58,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794142936] [2025-03-04 15:23:58,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:58,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:58,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:58,226 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:23:58,229 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:23:58,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:23:58,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:23:58,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:58,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:58,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:23:58,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:23:58,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:23:58,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794142936] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:58,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:58,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:23:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523228871] [2025-03-04 15:23:58,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:58,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:23:58,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:58,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:23:58,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:23:58,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-04 15:23:58,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 64 transitions, 314 flow. Second operand has 11 states, 11 states have (on average 16.818181818181817) internal successors, (185), 11 states have internal predecessors, (185), 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:23:58,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:58,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-04 15:23:58,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:58,536 INFO L124 PetriNetUnfolderBase]: 444/937 cut-off events. [2025-03-04 15:23:58,537 INFO L125 PetriNetUnfolderBase]: For 309/311 co-relation queries the response was YES. [2025-03-04 15:23:58,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2096 conditions, 937 events. 444/937 cut-off events. For 309/311 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4848 event pairs, 300 based on Foata normal form. 2/926 useless extension candidates. Maximal degree in co-relation 1962. Up to 701 conditions per place. [2025-03-04 15:23:58,542 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 26 selfloop transitions, 21 changer transitions 0/60 dead transitions. [2025-03-04 15:23:58,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 384 flow [2025-03-04 15:23:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:23:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:23:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2025-03-04 15:23:58,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2025-03-04 15:23:58,543 INFO L175 Difference]: Start difference. First operand has 57 places, 64 transitions, 314 flow. Second operand 7 states and 144 transitions. [2025-03-04 15:23:58,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 384 flow [2025-03-04 15:23:58,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 60 transitions, 338 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:23:58,545 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 286 flow [2025-03-04 15:23:58,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=286, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2025-03-04 15:23:58,545 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2025-03-04 15:23:58,546 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 286 flow [2025-03-04 15:23:58,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.818181818181817) internal successors, (185), 11 states have internal predecessors, (185), 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:23:58,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:58,546 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:58,552 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:23:58,746 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:23:58,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:23:58,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:58,747 INFO L85 PathProgramCache]: Analyzing trace with hash -280132459, now seen corresponding path program 2 times [2025-03-04 15:23:58,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:58,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047000083] [2025-03-04 15:23:58,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:58,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:58,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:23:58,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:23:58,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:23:58,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:23:58,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:58,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047000083] [2025-03-04 15:23:58,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047000083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:23:58,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737422284] [2025-03-04 15:23:58,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:23:58,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:23:58,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:23:58,874 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:23:58,875 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:23:58,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 15:23:58,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:23:58,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:23:58,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:58,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:23:58,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:23:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:23:59,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:23:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:23:59,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737422284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:23:59,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:23:59,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 20 [2025-03-04 15:23:59,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367374997] [2025-03-04 15:23:59,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:23:59,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 15:23:59,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:59,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:23:59,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:23:59,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2025-03-04 15:23:59,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 286 flow. Second operand has 20 states, 20 states have (on average 15.0) internal successors, (300), 20 states have internal predecessors, (300), 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:23:59,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:59,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2025-03-04 15:23:59,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:59,720 INFO L124 PetriNetUnfolderBase]: 467/882 cut-off events. [2025-03-04 15:23:59,720 INFO L125 PetriNetUnfolderBase]: For 302/336 co-relation queries the response was YES. [2025-03-04 15:23:59,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 882 events. 467/882 cut-off events. For 302/336 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4038 event pairs, 18 based on Foata normal form. 26/879 useless extension candidates. Maximal degree in co-relation 1892. Up to 263 conditions per place. [2025-03-04 15:23:59,725 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 70 selfloop transitions, 27 changer transitions 0/108 dead transitions. [2025-03-04 15:23:59,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 632 flow [2025-03-04 15:23:59,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:23:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:23:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 287 transitions. [2025-03-04 15:23:59,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42518518518518517 [2025-03-04 15:23:59,726 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 286 flow. Second operand 15 states and 287 transitions. [2025-03-04 15:23:59,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 632 flow [2025-03-04 15:23:59,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 616 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:23:59,732 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 343 flow [2025-03-04 15:23:59,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=343, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2025-03-04 15:23:59,733 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2025-03-04 15:23:59,733 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 343 flow [2025-03-04 15:23:59,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 15.0) internal successors, (300), 20 states have internal predecessors, (300), 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:23:59,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:59,735 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:23:59,743 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:23:59,935 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:23:59,936 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:23:59,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:59,936 INFO L85 PathProgramCache]: Analyzing trace with hash -563912169, now seen corresponding path program 1 times [2025-03-04 15:23:59,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:59,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850188382] [2025-03-04 15:23:59,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:59,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:59,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:23:59,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:23:59,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:59,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-04 15:24:00,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:00,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850188382] [2025-03-04 15:24:00,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850188382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:00,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:00,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:00,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389754574] [2025-03-04 15:24:00,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:00,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:00,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:00,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:00,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:00,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2025-03-04 15:24:00,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 343 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:24:00,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:00,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2025-03-04 15:24:00,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:00,192 INFO L124 PetriNetUnfolderBase]: 481/932 cut-off events. [2025-03-04 15:24:00,193 INFO L125 PetriNetUnfolderBase]: For 606/629 co-relation queries the response was YES. [2025-03-04 15:24:00,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2281 conditions, 932 events. 481/932 cut-off events. For 606/629 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4568 event pairs, 90 based on Foata normal form. 24/949 useless extension candidates. Maximal degree in co-relation 2125. Up to 456 conditions per place. [2025-03-04 15:24:00,197 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 67 selfloop transitions, 6 changer transitions 0/84 dead transitions. [2025-03-04 15:24:00,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 84 transitions, 565 flow [2025-03-04 15:24:00,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-04 15:24:00,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-03-04 15:24:00,198 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 343 flow. Second operand 4 states and 116 transitions. [2025-03-04 15:24:00,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 84 transitions, 565 flow [2025-03-04 15:24:00,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 521 flow, removed 2 selfloop flow, removed 12 redundant places. [2025-03-04 15:24:00,201 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 315 flow [2025-03-04 15:24:00,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=315, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2025-03-04 15:24:00,202 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2025-03-04 15:24:00,203 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 315 flow [2025-03-04 15:24:00,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:24:00,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:00,203 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:00,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:24:00,203 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:24:00,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:00,204 INFO L85 PathProgramCache]: Analyzing trace with hash 300819303, now seen corresponding path program 1 times [2025-03-04 15:24:00,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:00,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753737826] [2025-03-04 15:24:00,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:00,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:00,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:24:00,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:24:00,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:00,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:24:00,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:00,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753737826] [2025-03-04 15:24:00,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753737826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:24:00,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813399897] [2025-03-04 15:24:00,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:00,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:00,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:00,317 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:24:00,319 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:24:00,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:24:00,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:24:00,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:00,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:00,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:24:00,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:24:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:24:00,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:24:00,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813399897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:00,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:24:00,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:24:00,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130690283] [2025-03-04 15:24:00,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:00,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:24:00,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:00,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:24:00,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:24:00,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2025-03-04 15:24:00,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 315 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:24:00,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:00,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2025-03-04 15:24:00,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:00,588 INFO L124 PetriNetUnfolderBase]: 491/962 cut-off events. [2025-03-04 15:24:00,589 INFO L125 PetriNetUnfolderBase]: For 682/682 co-relation queries the response was YES. [2025-03-04 15:24:00,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2388 conditions, 962 events. 491/962 cut-off events. For 682/682 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4547 event pairs, 31 based on Foata normal form. 27/955 useless extension candidates. Maximal degree in co-relation 2249. Up to 261 conditions per place. [2025-03-04 15:24:00,592 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 92 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-03-04 15:24:00,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 106 transitions, 722 flow [2025-03-04 15:24:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:24:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:24:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2025-03-04 15:24:00,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6185185185185185 [2025-03-04 15:24:00,593 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 315 flow. Second operand 6 states and 167 transitions. [2025-03-04 15:24:00,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 106 transitions, 722 flow [2025-03-04 15:24:00,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 106 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:24:00,596 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 313 flow [2025-03-04 15:24:00,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2025-03-04 15:24:00,596 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2025-03-04 15:24:00,596 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 313 flow [2025-03-04 15:24:00,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:24:00,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:00,596 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:00,603 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:24:00,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:24:00,797 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:24:00,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:00,798 INFO L85 PathProgramCache]: Analyzing trace with hash 735464239, now seen corresponding path program 1 times [2025-03-04 15:24:00,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:00,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244421072] [2025-03-04 15:24:00,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:00,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:00,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 15:24:00,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:24:00,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:00,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-04 15:24:00,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:00,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244421072] [2025-03-04 15:24:00,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244421072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:00,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:00,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:00,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713712197] [2025-03-04 15:24:00,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:00,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:00,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:00,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:00,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:00,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2025-03-04 15:24:00,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 313 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:24:00,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:00,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2025-03-04 15:24:00,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:01,015 INFO L124 PetriNetUnfolderBase]: 505/1008 cut-off events. [2025-03-04 15:24:01,015 INFO L125 PetriNetUnfolderBase]: For 757/757 co-relation queries the response was YES. [2025-03-04 15:24:01,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2521 conditions, 1008 events. 505/1008 cut-off events. For 757/757 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5055 event pairs, 105 based on Foata normal form. 27/1021 useless extension candidates. Maximal degree in co-relation 2381. Up to 441 conditions per place. [2025-03-04 15:24:01,019 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 67 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2025-03-04 15:24:01,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 550 flow [2025-03-04 15:24:01,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-03-04 15:24:01,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6277777777777778 [2025-03-04 15:24:01,020 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 313 flow. Second operand 4 states and 113 transitions. [2025-03-04 15:24:01,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 550 flow [2025-03-04 15:24:01,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 82 transitions, 537 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 15:24:01,023 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 316 flow [2025-03-04 15:24:01,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=316, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2025-03-04 15:24:01,025 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2025-03-04 15:24:01,025 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 316 flow [2025-03-04 15:24:01,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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:24:01,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:01,025 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:01,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:24:01,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:24:01,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1851869747, now seen corresponding path program 1 times [2025-03-04 15:24:01,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:01,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095322713] [2025-03-04 15:24:01,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:01,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:01,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 15:24:01,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 15:24:01,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:01,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:24:01,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:01,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095322713] [2025-03-04 15:24:01,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095322713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:01,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:01,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:24:01,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132633894] [2025-03-04 15:24:01,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:01,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:01,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:01,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:01,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:01,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-03-04 15:24:01,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 316 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:24:01,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:01,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-03-04 15:24:01,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:01,237 INFO L124 PetriNetUnfolderBase]: 642/1227 cut-off events. [2025-03-04 15:24:01,237 INFO L125 PetriNetUnfolderBase]: For 989/989 co-relation queries the response was YES. [2025-03-04 15:24:01,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3175 conditions, 1227 events. 642/1227 cut-off events. For 989/989 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6489 event pairs, 286 based on Foata normal form. 5/1220 useless extension candidates. Maximal degree in co-relation 3037. Up to 577 conditions per place. [2025-03-04 15:24:01,242 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 74 selfloop transitions, 5 changer transitions 2/89 dead transitions. [2025-03-04 15:24:01,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 89 transitions, 596 flow [2025-03-04 15:24:01,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-03-04 15:24:01,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-03-04 15:24:01,243 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 316 flow. Second operand 5 states and 145 transitions. [2025-03-04 15:24:01,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 89 transitions, 596 flow [2025-03-04 15:24:01,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:24:01,246 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 328 flow [2025-03-04 15:24:01,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2025-03-04 15:24:01,246 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2025-03-04 15:24:01,246 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 328 flow [2025-03-04 15:24:01,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:24:01,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:01,247 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:01,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:24:01,248 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:24:01,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:01,248 INFO L85 PathProgramCache]: Analyzing trace with hash -532425215, now seen corresponding path program 2 times [2025-03-04 15:24:01,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:01,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269460489] [2025-03-04 15:24:01,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:24:01,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:01,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 15:24:01,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 46 statements. [2025-03-04 15:24:01,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:24:01,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:24:01,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:01,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269460489] [2025-03-04 15:24:01,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269460489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:01,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:01,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:24:01,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539867623] [2025-03-04 15:24:01,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:01,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:01,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:01,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:01,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:01,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-03-04 15:24:01,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 328 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:24:01,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:01,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-03-04 15:24:01,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:01,452 INFO L124 PetriNetUnfolderBase]: 667/1314 cut-off events. [2025-03-04 15:24:01,452 INFO L125 PetriNetUnfolderBase]: For 1118/1118 co-relation queries the response was YES. [2025-03-04 15:24:01,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 1314 events. 667/1314 cut-off events. For 1118/1118 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7080 event pairs, 332 based on Foata normal form. 4/1299 useless extension candidates. Maximal degree in co-relation 3217. Up to 647 conditions per place. [2025-03-04 15:24:01,456 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 72 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-03-04 15:24:01,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 86 transitions, 586 flow [2025-03-04 15:24:01,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2025-03-04 15:24:01,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2025-03-04 15:24:01,458 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 328 flow. Second operand 5 states and 141 transitions. [2025-03-04 15:24:01,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 86 transitions, 586 flow [2025-03-04 15:24:01,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 86 transitions, 577 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:24:01,461 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 342 flow [2025-03-04 15:24:01,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=342, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2025-03-04 15:24:01,461 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2025-03-04 15:24:01,461 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 342 flow [2025-03-04 15:24:01,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:24:01,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:01,462 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:01,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:24:01,462 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:24:01,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:01,462 INFO L85 PathProgramCache]: Analyzing trace with hash 867884137, now seen corresponding path program 3 times [2025-03-04 15:24:01,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:01,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572526883] [2025-03-04 15:24:01,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:24:01,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:01,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 6 equivalence classes. [2025-03-04 15:24:01,475 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 46 statements. [2025-03-04 15:24:01,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:24:01,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:24:01,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:01,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572526883] [2025-03-04 15:24:01,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572526883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:01,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:01,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:24:01,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674890208] [2025-03-04 15:24:01,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:01,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:01,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:01,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:01,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:01,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-03-04 15:24:01,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 342 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:24:01,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:01,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-03-04 15:24:01,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:01,673 INFO L124 PetriNetUnfolderBase]: 867/1711 cut-off events. [2025-03-04 15:24:01,673 INFO L125 PetriNetUnfolderBase]: For 1781/1781 co-relation queries the response was YES. [2025-03-04 15:24:01,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4546 conditions, 1711 events. 867/1711 cut-off events. For 1781/1781 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10138 event pairs, 353 based on Foata normal form. 28/1715 useless extension candidates. Maximal degree in co-relation 4402. Up to 1147 conditions per place. [2025-03-04 15:24:01,682 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 69 selfloop transitions, 4 changer transitions 2/84 dead transitions. [2025-03-04 15:24:01,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 84 transitions, 595 flow [2025-03-04 15:24:01,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-03-04 15:24:01,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:24:01,684 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 342 flow. Second operand 4 states and 120 transitions. [2025-03-04 15:24:01,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 84 transitions, 595 flow [2025-03-04 15:24:01,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 84 transitions, 587 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:24:01,687 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 394 flow [2025-03-04 15:24:01,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=394, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2025-03-04 15:24:01,688 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2025-03-04 15:24:01,688 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 394 flow [2025-03-04 15:24:01,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:24:01,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:01,688 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:01,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:24:01,688 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:24:01,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:01,691 INFO L85 PathProgramCache]: Analyzing trace with hash -193191427, now seen corresponding path program 4 times [2025-03-04 15:24:01,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:01,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403295678] [2025-03-04 15:24:01,691 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:24:01,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:01,703 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-03-04 15:24:01,705 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 46 statements. [2025-03-04 15:24:01,705 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 15:24:01,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:24:01,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:01,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403295678] [2025-03-04 15:24:01,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403295678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:01,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:01,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:24:01,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236900821] [2025-03-04 15:24:01,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:01,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:01,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:01,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:01,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:01,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-03-04 15:24:01,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 394 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:24:01,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:01,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-03-04 15:24:01,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:01,926 INFO L124 PetriNetUnfolderBase]: 947/1860 cut-off events. [2025-03-04 15:24:01,927 INFO L125 PetriNetUnfolderBase]: For 2640/2640 co-relation queries the response was YES. [2025-03-04 15:24:01,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5120 conditions, 1860 events. 947/1860 cut-off events. For 2640/2640 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11093 event pairs, 383 based on Foata normal form. 24/1858 useless extension candidates. Maximal degree in co-relation 4975. Up to 1281 conditions per place. [2025-03-04 15:24:01,937 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 71 selfloop transitions, 6 changer transitions 3/89 dead transitions. [2025-03-04 15:24:01,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 89 transitions, 670 flow [2025-03-04 15:24:01,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-03-04 15:24:01,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6722222222222223 [2025-03-04 15:24:01,938 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 394 flow. Second operand 4 states and 121 transitions. [2025-03-04 15:24:01,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 89 transitions, 670 flow [2025-03-04 15:24:01,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 89 transitions, 670 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:24:01,942 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 468 flow [2025-03-04 15:24:01,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=468, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2025-03-04 15:24:01,943 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2025-03-04 15:24:01,943 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 468 flow [2025-03-04 15:24:01,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:24:01,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:01,943 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:01,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:24:01,944 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:24:01,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:01,944 INFO L85 PathProgramCache]: Analyzing trace with hash 977353875, now seen corresponding path program 1 times [2025-03-04 15:24:01,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:01,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972696696] [2025-03-04 15:24:01,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:01,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:01,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 15:24:01,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:24:01,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:01,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:24:02,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:02,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972696696] [2025-03-04 15:24:02,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972696696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:02,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:02,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:24:02,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182036975] [2025-03-04 15:24:02,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:02,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:02,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:02,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:02,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:02,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-03-04 15:24:02,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 468 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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:24:02,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:02,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-03-04 15:24:02,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:02,163 INFO L124 PetriNetUnfolderBase]: 870/1701 cut-off events. [2025-03-04 15:24:02,163 INFO L125 PetriNetUnfolderBase]: For 3405/3405 co-relation queries the response was YES. [2025-03-04 15:24:02,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4934 conditions, 1701 events. 870/1701 cut-off events. For 3405/3405 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9940 event pairs, 417 based on Foata normal form. 22/1697 useless extension candidates. Maximal degree in co-relation 4786. Up to 858 conditions per place. [2025-03-04 15:24:02,170 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 79 selfloop transitions, 8 changer transitions 3/99 dead transitions. [2025-03-04 15:24:02,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 99 transitions, 786 flow [2025-03-04 15:24:02,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-03-04 15:24:02,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2025-03-04 15:24:02,171 INFO L175 Difference]: Start difference. First operand has 80 places, 68 transitions, 468 flow. Second operand 4 states and 128 transitions. [2025-03-04 15:24:02,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 99 transitions, 786 flow [2025-03-04 15:24:02,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 99 transitions, 780 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 15:24:02,175 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 486 flow [2025-03-04 15:24:02,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=486, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2025-03-04 15:24:02,175 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2025-03-04 15:24:02,176 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 486 flow [2025-03-04 15:24:02,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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:24:02,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:02,176 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:02,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:24:02,176 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:24:02,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1426334300, now seen corresponding path program 1 times [2025-03-04 15:24:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:02,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886510616] [2025-03-04 15:24:02,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:02,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:02,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 15:24:02,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:24:02,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:02,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:24:02,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:02,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886510616] [2025-03-04 15:24:02,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886510616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:02,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:02,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:24:02,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374085237] [2025-03-04 15:24:02,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:02,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:24:02,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:02,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:24:02,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:24:02,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2025-03-04 15:24:02,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:24:02,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:02,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2025-03-04 15:24:02,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:02,385 INFO L124 PetriNetUnfolderBase]: 808/1588 cut-off events. [2025-03-04 15:24:02,385 INFO L125 PetriNetUnfolderBase]: For 3960/3960 co-relation queries the response was YES. [2025-03-04 15:24:02,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4775 conditions, 1588 events. 808/1588 cut-off events. For 3960/3960 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9253 event pairs, 421 based on Foata normal form. 14/1591 useless extension candidates. Maximal degree in co-relation 4625. Up to 964 conditions per place. [2025-03-04 15:24:02,394 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 71 selfloop transitions, 2 changer transitions 2/83 dead transitions. [2025-03-04 15:24:02,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 83 transitions, 731 flow [2025-03-04 15:24:02,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:24:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:24:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-04 15:24:02,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:24:02,395 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 486 flow. Second operand 3 states and 90 transitions. [2025-03-04 15:24:02,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 83 transitions, 731 flow [2025-03-04 15:24:02,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 83 transitions, 699 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:24:02,399 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 475 flow [2025-03-04 15:24:02,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=475, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2025-03-04 15:24:02,399 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2025-03-04 15:24:02,399 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 475 flow [2025-03-04 15:24:02,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:24:02,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:02,400 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:02,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:24:02,400 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:24:02,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1506701486, now seen corresponding path program 1 times [2025-03-04 15:24:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:02,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820644367] [2025-03-04 15:24:02,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:02,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 15:24:02,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 15:24:02,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:02,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:02,536 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:24:02,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:02,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820644367] [2025-03-04 15:24:02,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820644367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:02,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:02,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:02,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870237156] [2025-03-04 15:24:02,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:02,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:02,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:02,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:02,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:02,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2025-03-04 15:24:02,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 475 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:24:02,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:02,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2025-03-04 15:24:02,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:02,680 INFO L124 PetriNetUnfolderBase]: 808/1604 cut-off events. [2025-03-04 15:24:02,680 INFO L125 PetriNetUnfolderBase]: For 3138/3138 co-relation queries the response was YES. [2025-03-04 15:24:02,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4850 conditions, 1604 events. 808/1604 cut-off events. For 3138/3138 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9375 event pairs, 148 based on Foata normal form. 10/1607 useless extension candidates. Maximal degree in co-relation 4699. Up to 1142 conditions per place. [2025-03-04 15:24:02,692 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 68 selfloop transitions, 3 changer transitions 2/81 dead transitions. [2025-03-04 15:24:02,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 81 transitions, 683 flow [2025-03-04 15:24:02,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-04 15:24:02,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2025-03-04 15:24:02,693 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 475 flow. Second operand 4 states and 106 transitions. [2025-03-04 15:24:02,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 81 transitions, 683 flow [2025-03-04 15:24:02,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 81 transitions, 679 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:24:02,700 INFO L231 Difference]: Finished difference. Result has 82 places, 67 transitions, 473 flow [2025-03-04 15:24:02,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=473, PETRI_PLACES=82, PETRI_TRANSITIONS=67} [2025-03-04 15:24:02,701 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2025-03-04 15:24:02,701 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 473 flow [2025-03-04 15:24:02,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:24:02,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:02,701 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:02,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:24:02,702 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-04 15:24:02,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:02,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2038540498, now seen corresponding path program 1 times [2025-03-04 15:24:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:02,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126115608] [2025-03-04 15:24:02,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:02,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 15:24:02,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:24:02,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:02,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:24:02,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:02,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126115608] [2025-03-04 15:24:02,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126115608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:02,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:02,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467134790] [2025-03-04 15:24:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:02,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:02,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:02,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:02,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:02,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2025-03-04 15:24:02,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 473 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:24:02,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:02,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2025-03-04 15:24:02,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:02,945 INFO L124 PetriNetUnfolderBase]: 808/1598 cut-off events. [2025-03-04 15:24:02,945 INFO L125 PetriNetUnfolderBase]: For 3269/3269 co-relation queries the response was YES. [2025-03-04 15:24:02,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4788 conditions, 1598 events. 808/1598 cut-off events. For 3269/3269 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9310 event pairs, 112 based on Foata normal form. 10/1605 useless extension candidates. Maximal degree in co-relation 4637. Up to 1132 conditions per place. [2025-03-04 15:24:02,950 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 0 selfloop transitions, 0 changer transitions 80/80 dead transitions. [2025-03-04 15:24:02,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 80 transitions, 679 flow [2025-03-04 15:24:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-03-04 15:24:02,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 15:24:02,951 INFO L175 Difference]: Start difference. First operand has 82 places, 67 transitions, 473 flow. Second operand 4 states and 105 transitions. [2025-03-04 15:24:02,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 80 transitions, 679 flow [2025-03-04 15:24:02,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 80 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:24:02,954 INFO L231 Difference]: Finished difference. Result has 82 places, 0 transitions, 0 flow [2025-03-04 15:24:02,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=82, PETRI_TRANSITIONS=0} [2025-03-04 15:24:02,954 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2025-03-04 15:24:02,954 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 0 transitions, 0 flow [2025-03-04 15:24:02,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-04 15:24:02,957 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-04 15:24:02,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:24:02,958 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:02,961 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:24:02,961 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:24:02,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:24:02 BasicIcfg [2025-03-04 15:24:02,968 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:24:02,969 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:24:02,969 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:24:02,969 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:24:02,969 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:55" (3/4) ... [2025-03-04 15:24:02,970 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:24:02,972 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:24:02,972 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:24:02,977 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 83 nodes and edges [2025-03-04 15:24:02,977 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2025-03-04 15:24:02,977 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-03-04 15:24:02,977 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 15:24:03,038 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:24:03,038 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:24:03,038 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:24:03,039 INFO L158 Benchmark]: Toolchain (without parser) took 8781.45ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 104.5MB in the beginning and 295.4MB in the end (delta: -190.9MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2025-03-04 15:24:03,039 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:24:03,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.16ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 92.3MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:24:03,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.46ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 91.3MB in the end (delta: 985.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:24:03,040 INFO L158 Benchmark]: Boogie Preprocessor took 28.08ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:24:03,040 INFO L158 Benchmark]: IcfgBuilder took 542.08ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 42.8MB in the end (delta: 46.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 15:24:03,040 INFO L158 Benchmark]: TraceAbstraction took 7918.98ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 42.8MB in the beginning and 303.8MB in the end (delta: -261.0MB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. [2025-03-04 15:24:03,040 INFO L158 Benchmark]: Witness Printer took 69.63ms. Allocated memory is still 394.3MB. Free memory was 303.8MB in the beginning and 295.4MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:24:03,041 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.16ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 92.3MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.46ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 91.3MB in the end (delta: 985.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.08ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 542.08ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 42.8MB in the end (delta: 46.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7918.98ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 42.8MB in the beginning and 303.8MB in the end (delta: -261.0MB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. * Witness Printer took 69.63ms. Allocated memory is still 394.3MB. Free memory was 303.8MB in the beginning and 295.4MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 103]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 60 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.8s, OverallIterations: 20, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 737 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 651 mSDsluCounter, 445 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 393 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2814 IncrementalHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 52 mSDtfsCounter, 2814 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=486occurred in iteration=17, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 738 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 779 ConstructedInterpolants, 0 QuantifiedInterpolants, 1362 SizeOfPredicates, 16 NumberOfNonLiveVariables, 860 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 30 InterpolantComputations, 16 PerfectInterpolantSequences, 988/1056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:24:03,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE