./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/loop-tiling-eq.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/loop-tiling-eq.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 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:26:14,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:26:14,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:26:14,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:26:14,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:26:14,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:26:14,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:26:14,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:26:14,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:26:14,711 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:26:14,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:26:14,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:26:14,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:26:14,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:26:14,712 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:26:14,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:26:14,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:26:14,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:26:14,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:26:14,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:26:14,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:26:14,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:26:14,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:26:14,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:26:14,713 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:26:14,713 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:26:14,713 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:26:14,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:26:14,713 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:26:14,713 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:26:14,714 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:26:14,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:26:14,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:26:14,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:26:14,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:26:14,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:26:14,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:26:14,714 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:26:14,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:26:14,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:26:14,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:26:14,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:26:14,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:26:14,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:26:14,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:26:14,715 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 -> 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 [2025-03-04 15:26:14,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:26:14,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:26:14,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:26:14,940 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:26:14,941 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:26:14,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-03-04 15:26:16,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab47a18d4/6b4142688ce048b7998425cb584bbde5/FLAG70e049c08 [2025-03-04 15:26:16,320 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:26:16,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2025-03-04 15:26:16,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab47a18d4/6b4142688ce048b7998425cb584bbde5/FLAG70e049c08 [2025-03-04 15:26:16,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab47a18d4/6b4142688ce048b7998425cb584bbde5 [2025-03-04 15:26:16,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:26:16,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:26:16,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:26:16,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:26:16,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:26:16,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:26:16" (1/1) ... [2025-03-04 15:26:16,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50713151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:16, skipping insertion in model container [2025-03-04 15:26:16,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:26:16" (1/1) ... [2025-03-04 15:26:16,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:26:16,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:26:16,507 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:26:16,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:26:16,547 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:26:16,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:16 WrapperNode [2025-03-04 15:26:16,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:26:16,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:26:16,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:26:16,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:26:16,553 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:26:16" (1/1) ... [2025-03-04 15:26:16,560 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:26:16" (1/1) ... [2025-03-04 15:26:16,582 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 194 [2025-03-04 15:26:16,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:26:16,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:26:16,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:26:16,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:26:16,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:16" (1/1) ... [2025-03-04 15:26:16,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:16" (1/1) ... [2025-03-04 15:26:16,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:16" (1/1) ... [2025-03-04 15:26:16,614 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 9, 3]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 5, 1]. [2025-03-04 15:26:16,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:16" (1/1) ... [2025-03-04 15:26:16,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:16" (1/1) ... [2025-03-04 15:26:16,624 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:16" (1/1) ... [2025-03-04 15:26:16,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:16" (1/1) ... [2025-03-04 15:26:16,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:16" (1/1) ... [2025-03-04 15:26:16,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:16" (1/1) ... [2025-03-04 15:26:16,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:26:16,630 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:26:16,630 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:26:16,630 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:26:16,631 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:16" (1/1) ... [2025-03-04 15:26:16,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:26:16,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:16,655 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:26:16,657 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:26:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 15:26:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 15:26:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 15:26:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:26:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:26:16,673 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:26:16,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:26:16,674 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:26:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:26:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:26:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:26:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 15:26:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 15:26:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 15:26:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:26:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:26:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:26:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:26:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:26:16,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:26:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:26:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:26:16,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:26:16,675 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:26:16,771 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:26:16,773 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:26:17,128 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:26:17,128 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:26:17,344 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:26:17,345 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:26:17,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:17 BoogieIcfgContainer [2025-03-04 15:26:17,346 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:26:17,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:26:17,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:26:17,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:26:17,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:26:16" (1/3) ... [2025-03-04 15:26:17,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a760a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:26:17, skipping insertion in model container [2025-03-04 15:26:17,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:26:16" (2/3) ... [2025-03-04 15:26:17,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a760a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:26:17, skipping insertion in model container [2025-03-04 15:26:17,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:26:17" (3/3) ... [2025-03-04 15:26:17,353 INFO L128 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2025-03-04 15:26:17,365 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:26:17,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG loop-tiling-eq.wvr.c that has 3 procedures, 74 locations, 1 initial locations, 7 loop locations, and 26 error locations. [2025-03-04 15:26:17,367 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:26:17,418 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:26:17,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 81 transitions, 176 flow [2025-03-04 15:26:17,473 INFO L124 PetriNetUnfolderBase]: 8/79 cut-off events. [2025-03-04 15:26:17,475 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:26:17,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 79 events. 8/79 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 208 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-03-04 15:26:17,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 81 transitions, 176 flow [2025-03-04 15:26:17,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 78 transitions, 168 flow [2025-03-04 15:26:17,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:26:17,500 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;@5a8ac6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:26:17,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-04 15:26:17,505 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:26:17,508 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-04 15:26:17,509 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:26:17,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:17,510 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:26:17,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:17,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:17,515 INFO L85 PathProgramCache]: Analyzing trace with hash 673997, now seen corresponding path program 1 times [2025-03-04 15:26:17,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:17,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783486371] [2025-03-04 15:26:17,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:17,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:17,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:26:17,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:26:17,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:17,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:26:17,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926316073] [2025-03-04 15:26:17,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:17,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:17,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:17,602 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:26:17,604 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:26:17,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:26:17,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:26:17,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:17,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:17,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:17,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:17,738 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:26:17,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:17,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:17,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783486371] [2025-03-04 15:26:17,739 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 15:26:17,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926316073] [2025-03-04 15:26:17,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926316073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:17,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:17,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:26:17,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991250534] [2025-03-04 15:26:17,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:17,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:17,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:17,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:17,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:17,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 81 [2025-03-04 15:26:17,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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:26:17,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:17,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 81 [2025-03-04 15:26:17,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:18,087 INFO L124 PetriNetUnfolderBase]: 226/661 cut-off events. [2025-03-04 15:26:18,087 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-04 15:26:18,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 661 events. 226/661 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3889 event pairs, 150 based on Foata normal form. 1/480 useless extension candidates. Maximal degree in co-relation 446. Up to 199 conditions per place. [2025-03-04 15:26:18,093 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 69 selfloop transitions, 4 changer transitions 0/111 dead transitions. [2025-03-04 15:26:18,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 111 transitions, 392 flow [2025-03-04 15:26:18,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 275 transitions. [2025-03-04 15:26:18,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6790123456790124 [2025-03-04 15:26:18,107 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 168 flow. Second operand 5 states and 275 transitions. [2025-03-04 15:26:18,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 111 transitions, 392 flow [2025-03-04 15:26:18,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 111 transitions, 376 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:26:18,115 INFO L231 Difference]: Finished difference. Result has 76 places, 77 transitions, 171 flow [2025-03-04 15:26:18,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=76, PETRI_TRANSITIONS=77} [2025-03-04 15:26:18,119 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -1 predicate places. [2025-03-04 15:26:18,119 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 77 transitions, 171 flow [2025-03-04 15:26:18,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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:26:18,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:18,119 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:26:18,126 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:26:18,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 15:26:18,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:18,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash 20895268, now seen corresponding path program 1 times [2025-03-04 15:26:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:18,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901043536] [2025-03-04 15:26:18,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:18,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:26:18,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:26:18,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:18,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:26:18,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1126703823] [2025-03-04 15:26:18,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:18,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:18,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:18,341 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:26:18,343 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:26:18,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:26:18,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:26:18,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:18,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:18,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:26:18,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:18,426 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:26:18,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:18,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:18,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901043536] [2025-03-04 15:26:18,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 15:26:18,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126703823] [2025-03-04 15:26:18,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126703823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:18,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:18,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:26:18,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960924013] [2025-03-04 15:26:18,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:18,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:18,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:18,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:18,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:18,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 81 [2025-03-04 15:26:18,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 77 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:18,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:18,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 81 [2025-03-04 15:26:18,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:18,605 INFO L124 PetriNetUnfolderBase]: 226/651 cut-off events. [2025-03-04 15:26:18,606 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 15:26:18,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 651 events. 226/651 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3835 event pairs, 150 based on Foata normal form. 2/475 useless extension candidates. Maximal degree in co-relation 532. Up to 200 conditions per place. [2025-03-04 15:26:18,609 INFO L140 encePairwiseOnDemand]: 74/81 looper letters, 65 selfloop transitions, 4 changer transitions 1/108 dead transitions. [2025-03-04 15:26:18,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 108 transitions, 377 flow [2025-03-04 15:26:18,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 273 transitions. [2025-03-04 15:26:18,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2025-03-04 15:26:18,613 INFO L175 Difference]: Start difference. First operand has 76 places, 77 transitions, 171 flow. Second operand 5 states and 273 transitions. [2025-03-04 15:26:18,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 108 transitions, 377 flow [2025-03-04 15:26:18,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 108 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:18,615 INFO L231 Difference]: Finished difference. Result has 79 places, 77 transitions, 182 flow [2025-03-04 15:26:18,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2025-03-04 15:26:18,615 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 2 predicate places. [2025-03-04 15:26:18,616 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 182 flow [2025-03-04 15:26:18,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:18,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:18,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:26:18,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:26:18,817 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,SelfDestructingSolverStorable1 [2025-03-04 15:26:18,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:18,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1395228462, now seen corresponding path program 1 times [2025-03-04 15:26:18,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:18,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670137263] [2025-03-04 15:26:18,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:18,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:18,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:26:18,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:26:18,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:18,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:26:18,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449310905] [2025-03-04 15:26:18,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:18,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:18,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:18,830 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:26:18,832 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:26:18,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:26:18,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:26:18,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:18,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:18,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:26:18,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:18,973 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:26:18,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:18,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:18,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670137263] [2025-03-04 15:26:18,973 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 15:26:18,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449310905] [2025-03-04 15:26:18,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449310905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:18,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:18,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:26:18,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069882221] [2025-03-04 15:26:18,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:18,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:18,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:18,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:18,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:19,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 81 [2025-03-04 15:26:19,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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:26:19,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:19,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 81 [2025-03-04 15:26:19,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:19,236 INFO L124 PetriNetUnfolderBase]: 226/650 cut-off events. [2025-03-04 15:26:19,236 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 15:26:19,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 650 events. 226/650 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3811 event pairs, 150 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 533. Up to 198 conditions per place. [2025-03-04 15:26:19,240 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 64 selfloop transitions, 4 changer transitions 1/107 dead transitions. [2025-03-04 15:26:19,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 107 transitions, 382 flow [2025-03-04 15:26:19,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 270 transitions. [2025-03-04 15:26:19,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:26:19,243 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 182 flow. Second operand 5 states and 270 transitions. [2025-03-04 15:26:19,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 107 transitions, 382 flow [2025-03-04 15:26:19,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 107 transitions, 374 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:19,245 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 178 flow [2025-03-04 15:26:19,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2025-03-04 15:26:19,246 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 2 predicate places. [2025-03-04 15:26:19,246 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 178 flow [2025-03-04 15:26:19,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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:26:19,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:19,246 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:19,253 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:26:19,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:19,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:19,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash -302408735, now seen corresponding path program 1 times [2025-03-04 15:26:19,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:19,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42911716] [2025-03-04 15:26:19,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:19,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:19,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:26:19,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:26:19,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:19,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:26:19,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [648189199] [2025-03-04 15:26:19,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:19,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:19,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:19,466 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:26:19,467 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:26:19,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:26:19,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:26:19,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:19,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:19,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:26:19,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:19,595 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:26:19,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:19,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:19,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42911716] [2025-03-04 15:26:19,597 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 15:26:19,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648189199] [2025-03-04 15:26:19,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648189199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:19,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:19,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:26:19,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452747378] [2025-03-04 15:26:19,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:19,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:26:19,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:19,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:26:19,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:26:19,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 81 [2025-03-04 15:26:19,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 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:26:19,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:19,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 81 [2025-03-04 15:26:19,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:20,074 INFO L124 PetriNetUnfolderBase]: 226/649 cut-off events. [2025-03-04 15:26:20,075 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 15:26:20,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 649 events. 226/649 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3812 event pairs, 150 based on Foata normal form. 1/473 useless extension candidates. Maximal degree in co-relation 534. Up to 196 conditions per place. [2025-03-04 15:26:20,079 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 63 selfloop transitions, 5 changer transitions 1/106 dead transitions. [2025-03-04 15:26:20,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 106 transitions, 378 flow [2025-03-04 15:26:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 304 transitions. [2025-03-04 15:26:20,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6255144032921811 [2025-03-04 15:26:20,081 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 178 flow. Second operand 6 states and 304 transitions. [2025-03-04 15:26:20,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 106 transitions, 378 flow [2025-03-04 15:26:20,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 106 transitions, 371 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:20,084 INFO L231 Difference]: Finished difference. Result has 80 places, 75 transitions, 177 flow [2025-03-04 15:26:20,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2025-03-04 15:26:20,085 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-03-04 15:26:20,086 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 177 flow [2025-03-04 15:26:20,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 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:26:20,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:20,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:20,092 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:26:20,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:20,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:20,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:20,287 INFO L85 PathProgramCache]: Analyzing trace with hash -278705705, now seen corresponding path program 1 times [2025-03-04 15:26:20,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:20,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023257993] [2025-03-04 15:26:20,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:20,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:20,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:26:20,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:26:20,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:20,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:20,421 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:26:20,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:20,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023257993] [2025-03-04 15:26:20,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023257993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:20,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:20,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:20,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911539380] [2025-03-04 15:26:20,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:20,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:20,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:20,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:20,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 81 [2025-03-04 15:26:20,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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:26:20,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:20,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 81 [2025-03-04 15:26:20,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:20,560 INFO L124 PetriNetUnfolderBase]: 232/673 cut-off events. [2025-03-04 15:26:20,561 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 15:26:20,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 673 events. 232/673 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4010 event pairs, 150 based on Foata normal form. 6/494 useless extension candidates. Maximal degree in co-relation 561. Up to 410 conditions per place. [2025-03-04 15:26:20,564 INFO L140 encePairwiseOnDemand]: 64/81 looper letters, 40 selfloop transitions, 11 changer transitions 0/84 dead transitions. [2025-03-04 15:26:20,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 84 transitions, 297 flow [2025-03-04 15:26:20,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2025-03-04 15:26:20,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2025-03-04 15:26:20,565 INFO L175 Difference]: Start difference. First operand has 80 places, 75 transitions, 177 flow. Second operand 4 states and 212 transitions. [2025-03-04 15:26:20,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 84 transitions, 297 flow [2025-03-04 15:26:20,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 281 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 15:26:20,567 INFO L231 Difference]: Finished difference. Result has 81 places, 84 transitions, 253 flow [2025-03-04 15:26:20,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=81, PETRI_TRANSITIONS=84} [2025-03-04 15:26:20,568 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 4 predicate places. [2025-03-04 15:26:20,568 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 253 flow [2025-03-04 15:26:20,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 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:26:20,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:20,568 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:20,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:26:20,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:20,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:20,569 INFO L85 PathProgramCache]: Analyzing trace with hash -749253182, now seen corresponding path program 1 times [2025-03-04 15:26:20,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:20,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718242827] [2025-03-04 15:26:20,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:20,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:20,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:26:20,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:26:20,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:20,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:20,663 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:26:20,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:20,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718242827] [2025-03-04 15:26:20,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718242827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:20,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109771450] [2025-03-04 15:26:20,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:20,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:20,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:20,666 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:26:20,668 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:26:20,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:26:20,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:26:20,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:20,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:20,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:20,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:20,757 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:26:20,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:20,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109771450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:20,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:20,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:26:20,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051904646] [2025-03-04 15:26:20,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:20,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:26:20,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:20,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:26:20,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:26:20,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 81 [2025-03-04 15:26:20,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:20,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:20,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 81 [2025-03-04 15:26:20,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:20,915 INFO L124 PetriNetUnfolderBase]: 232/667 cut-off events. [2025-03-04 15:26:20,915 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-03-04 15:26:20,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 667 events. 232/667 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3938 event pairs, 150 based on Foata normal form. 6/497 useless extension candidates. Maximal degree in co-relation 1033. Up to 380 conditions per place. [2025-03-04 15:26:20,918 INFO L140 encePairwiseOnDemand]: 67/81 looper letters, 29 selfloop transitions, 19 changer transitions 0/81 dead transitions. [2025-03-04 15:26:20,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 337 flow [2025-03-04 15:26:20,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 284 transitions. [2025-03-04 15:26:20,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5843621399176955 [2025-03-04 15:26:20,922 INFO L175 Difference]: Start difference. First operand has 81 places, 84 transitions, 253 flow. Second operand 6 states and 284 transitions. [2025-03-04 15:26:20,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 337 flow [2025-03-04 15:26:20,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 81 transitions, 337 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:26:20,924 INFO L231 Difference]: Finished difference. Result has 83 places, 81 transitions, 279 flow [2025-03-04 15:26:20,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=279, PETRI_PLACES=83, PETRI_TRANSITIONS=81} [2025-03-04 15:26:20,926 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-03-04 15:26:20,926 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 81 transitions, 279 flow [2025-03-04 15:26:20,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:20,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:20,926 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:20,932 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:26:21,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:21,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:21,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:21,127 INFO L85 PathProgramCache]: Analyzing trace with hash -747522638, now seen corresponding path program 1 times [2025-03-04 15:26:21,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:21,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595232169] [2025-03-04 15:26:21,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:21,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:21,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:26:21,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:26:21,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:21,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:21,249 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:26:21,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:21,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595232169] [2025-03-04 15:26:21,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595232169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:21,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:21,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:26:21,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563545198] [2025-03-04 15:26:21,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:21,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:21,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:21,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:21,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:21,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 81 [2025-03-04 15:26:21,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 81 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 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:26:21,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:21,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 81 [2025-03-04 15:26:21,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:21,415 INFO L124 PetriNetUnfolderBase]: 229/653 cut-off events. [2025-03-04 15:26:21,415 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-04 15:26:21,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 653 events. 229/653 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3849 event pairs, 150 based on Foata normal form. 1/488 useless extension candidates. Maximal degree in co-relation 1028. Up to 207 conditions per place. [2025-03-04 15:26:21,420 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 72 selfloop transitions, 6 changer transitions 1/113 dead transitions. [2025-03-04 15:26:21,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 113 transitions, 569 flow [2025-03-04 15:26:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 270 transitions. [2025-03-04 15:26:21,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:26:21,422 INFO L175 Difference]: Start difference. First operand has 83 places, 81 transitions, 279 flow. Second operand 5 states and 270 transitions. [2025-03-04 15:26:21,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 113 transitions, 569 flow [2025-03-04 15:26:21,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 113 transitions, 495 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 15:26:21,427 INFO L231 Difference]: Finished difference. Result has 84 places, 84 transitions, 269 flow [2025-03-04 15:26:21,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=84, PETRI_TRANSITIONS=84} [2025-03-04 15:26:21,428 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-03-04 15:26:21,428 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 84 transitions, 269 flow [2025-03-04 15:26:21,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 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:26:21,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:21,429 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:21,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:26:21,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:21,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:21,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1752011537, now seen corresponding path program 1 times [2025-03-04 15:26:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:21,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56892703] [2025-03-04 15:26:21,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:21,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:21,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:26:21,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:26:21,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:21,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:21,541 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:26:21,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:21,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56892703] [2025-03-04 15:26:21,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56892703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:21,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258126142] [2025-03-04 15:26:21,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:21,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:21,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:21,544 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:26:21,545 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:26:21,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:26:21,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:26:21,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:21,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:21,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:21,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:21,620 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:26:21,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:21,651 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:26:21,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258126142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:21,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:21,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:26:21,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656802245] [2025-03-04 15:26:21,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:21,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:26:21,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:21,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:26:21,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:26:21,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 81 [2025-03-04 15:26:21,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 84 transitions, 269 flow. Second operand has 12 states, 12 states have (on average 40.25) internal successors, (483), 12 states have internal predecessors, (483), 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:26:21,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:21,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 81 [2025-03-04 15:26:21,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:21,859 INFO L124 PetriNetUnfolderBase]: 244/713 cut-off events. [2025-03-04 15:26:21,859 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-04 15:26:21,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 713 events. 244/713 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4402 event pairs, 150 based on Foata normal form. 15/551 useless extension candidates. Maximal degree in co-relation 1024. Up to 406 conditions per place. [2025-03-04 15:26:21,863 INFO L140 encePairwiseOnDemand]: 67/81 looper letters, 39 selfloop transitions, 42 changer transitions 0/114 dead transitions. [2025-03-04 15:26:21,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 114 transitions, 581 flow [2025-03-04 15:26:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:26:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:26:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 473 transitions. [2025-03-04 15:26:21,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5839506172839506 [2025-03-04 15:26:21,865 INFO L175 Difference]: Start difference. First operand has 84 places, 84 transitions, 269 flow. Second operand 10 states and 473 transitions. [2025-03-04 15:26:21,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 114 transitions, 581 flow [2025-03-04 15:26:21,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 114 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:21,867 INFO L231 Difference]: Finished difference. Result has 94 places, 114 transitions, 552 flow [2025-03-04 15:26:21,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=552, PETRI_PLACES=94, PETRI_TRANSITIONS=114} [2025-03-04 15:26:21,871 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 17 predicate places. [2025-03-04 15:26:21,871 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 114 transitions, 552 flow [2025-03-04 15:26:21,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 40.25) internal successors, (483), 12 states have internal predecessors, (483), 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:26:21,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:21,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:21,879 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:26:22,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:22,072 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:22,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:22,073 INFO L85 PathProgramCache]: Analyzing trace with hash 161359328, now seen corresponding path program 1 times [2025-03-04 15:26:22,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:22,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110667359] [2025-03-04 15:26:22,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:22,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:22,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:26:22,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:26:22,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:22,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:22,132 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:26:22,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:22,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110667359] [2025-03-04 15:26:22,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110667359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:22,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:22,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:22,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687657015] [2025-03-04 15:26:22,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:22,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:22,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:22,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:22,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:22,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 81 [2025-03-04 15:26:22,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 114 transitions, 552 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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:26:22,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:22,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 81 [2025-03-04 15:26:22,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:22,240 INFO L124 PetriNetUnfolderBase]: 250/738 cut-off events. [2025-03-04 15:26:22,240 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2025-03-04 15:26:22,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1503 conditions, 738 events. 250/738 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4602 event pairs, 150 based on Foata normal form. 1/571 useless extension candidates. Maximal degree in co-relation 1312. Up to 443 conditions per place. [2025-03-04 15:26:22,243 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 80 selfloop transitions, 18 changer transitions 0/132 dead transitions. [2025-03-04 15:26:22,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 132 transitions, 865 flow [2025-03-04 15:26:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2025-03-04 15:26:22,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6697530864197531 [2025-03-04 15:26:22,244 INFO L175 Difference]: Start difference. First operand has 94 places, 114 transitions, 552 flow. Second operand 4 states and 217 transitions. [2025-03-04 15:26:22,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 132 transitions, 865 flow [2025-03-04 15:26:22,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 132 transitions, 818 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:22,248 INFO L231 Difference]: Finished difference. Result has 97 places, 121 transitions, 624 flow [2025-03-04 15:26:22,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=624, PETRI_PLACES=97, PETRI_TRANSITIONS=121} [2025-03-04 15:26:22,248 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 20 predicate places. [2025-03-04 15:26:22,249 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 121 transitions, 624 flow [2025-03-04 15:26:22,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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:26:22,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:22,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:22,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:26:22,249 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:22,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:22,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1107832793, now seen corresponding path program 1 times [2025-03-04 15:26:22,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:22,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877153212] [2025-03-04 15:26:22,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:22,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:22,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:26:22,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:26:22,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:22,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:22,289 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:26:22,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:22,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877153212] [2025-03-04 15:26:22,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877153212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:22,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:22,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:22,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734966127] [2025-03-04 15:26:22,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:22,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:22,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:22,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:22,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:22,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 81 [2025-03-04 15:26:22,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 121 transitions, 624 flow. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:22,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:22,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 81 [2025-03-04 15:26:22,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:22,448 INFO L124 PetriNetUnfolderBase]: 482/1166 cut-off events. [2025-03-04 15:26:22,448 INFO L125 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2025-03-04 15:26:22,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2299 conditions, 1166 events. 482/1166 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7324 event pairs, 218 based on Foata normal form. 32/923 useless extension candidates. Maximal degree in co-relation 2165. Up to 663 conditions per place. [2025-03-04 15:26:22,452 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 108 selfloop transitions, 4 changer transitions 0/146 dead transitions. [2025-03-04 15:26:22,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 146 transitions, 900 flow [2025-03-04 15:26:22,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2025-03-04 15:26:22,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7283950617283951 [2025-03-04 15:26:22,453 INFO L175 Difference]: Start difference. First operand has 97 places, 121 transitions, 624 flow. Second operand 4 states and 236 transitions. [2025-03-04 15:26:22,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 146 transitions, 900 flow [2025-03-04 15:26:22,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 146 transitions, 887 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:22,457 INFO L231 Difference]: Finished difference. Result has 101 places, 124 transitions, 640 flow [2025-03-04 15:26:22,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=640, PETRI_PLACES=101, PETRI_TRANSITIONS=124} [2025-03-04 15:26:22,458 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 24 predicate places. [2025-03-04 15:26:22,458 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 124 transitions, 640 flow [2025-03-04 15:26:22,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:22,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:22,458 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:22,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:26:22,458 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:22,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:22,458 INFO L85 PathProgramCache]: Analyzing trace with hash -917392479, now seen corresponding path program 1 times [2025-03-04 15:26:22,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:22,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958589586] [2025-03-04 15:26:22,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:22,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:26:22,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:26:22,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:22,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:22,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:22,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958589586] [2025-03-04 15:26:22,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958589586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:22,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:22,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:26:22,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000349689] [2025-03-04 15:26:22,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:22,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:22,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:22,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:22,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:22,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 81 [2025-03-04 15:26:22,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 124 transitions, 640 flow. Second operand has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 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:26:22,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:22,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 81 [2025-03-04 15:26:22,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:22,771 INFO L124 PetriNetUnfolderBase]: 538/1531 cut-off events. [2025-03-04 15:26:22,771 INFO L125 PetriNetUnfolderBase]: For 728/728 co-relation queries the response was YES. [2025-03-04 15:26:22,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3489 conditions, 1531 events. 538/1531 cut-off events. For 728/728 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10764 event pairs, 294 based on Foata normal form. 32/1289 useless extension candidates. Maximal degree in co-relation 3234. Up to 641 conditions per place. [2025-03-04 15:26:22,779 INFO L140 encePairwiseOnDemand]: 69/81 looper letters, 142 selfloop transitions, 20 changer transitions 0/198 dead transitions. [2025-03-04 15:26:22,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 198 transitions, 1384 flow [2025-03-04 15:26:22,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 355 transitions. [2025-03-04 15:26:22,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7304526748971193 [2025-03-04 15:26:22,781 INFO L175 Difference]: Start difference. First operand has 101 places, 124 transitions, 640 flow. Second operand 6 states and 355 transitions. [2025-03-04 15:26:22,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 198 transitions, 1384 flow [2025-03-04 15:26:22,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 198 transitions, 1379 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:22,786 INFO L231 Difference]: Finished difference. Result has 108 places, 133 transitions, 779 flow [2025-03-04 15:26:22,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=779, PETRI_PLACES=108, PETRI_TRANSITIONS=133} [2025-03-04 15:26:22,787 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 31 predicate places. [2025-03-04 15:26:22,787 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 133 transitions, 779 flow [2025-03-04 15:26:22,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 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:26:22,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:22,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:22,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:26:22,787 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:22,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1406737202, now seen corresponding path program 1 times [2025-03-04 15:26:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:22,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715955438] [2025-03-04 15:26:22,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:22,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:26:22,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:26:22,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:22,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:22,862 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:26:22,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:22,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715955438] [2025-03-04 15:26:22,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715955438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:22,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:22,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:26:22,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128978367] [2025-03-04 15:26:22,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:22,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:22,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:22,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:22,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:22,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 81 [2025-03-04 15:26:22,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 133 transitions, 779 flow. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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:26:22,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:22,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 81 [2025-03-04 15:26:22,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:23,081 INFO L124 PetriNetUnfolderBase]: 440/1119 cut-off events. [2025-03-04 15:26:23,081 INFO L125 PetriNetUnfolderBase]: For 889/889 co-relation queries the response was YES. [2025-03-04 15:26:23,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3039 conditions, 1119 events. 440/1119 cut-off events. For 889/889 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6659 event pairs, 267 based on Foata normal form. 0/1008 useless extension candidates. Maximal degree in co-relation 2769. Up to 624 conditions per place. [2025-03-04 15:26:23,088 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 138 selfloop transitions, 5 changer transitions 13/188 dead transitions. [2025-03-04 15:26:23,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 188 transitions, 1418 flow [2025-03-04 15:26:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 262 transitions. [2025-03-04 15:26:23,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6469135802469136 [2025-03-04 15:26:23,090 INFO L175 Difference]: Start difference. First operand has 108 places, 133 transitions, 779 flow. Second operand 5 states and 262 transitions. [2025-03-04 15:26:23,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 188 transitions, 1418 flow [2025-03-04 15:26:23,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 188 transitions, 1414 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 15:26:23,098 INFO L231 Difference]: Finished difference. Result has 114 places, 133 transitions, 773 flow [2025-03-04 15:26:23,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=773, PETRI_PLACES=114, PETRI_TRANSITIONS=133} [2025-03-04 15:26:23,099 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 37 predicate places. [2025-03-04 15:26:23,100 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 133 transitions, 773 flow [2025-03-04 15:26:23,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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:26:23,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:23,101 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:23,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:26:23,101 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:23,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash 560495041, now seen corresponding path program 1 times [2025-03-04 15:26:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:23,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506763292] [2025-03-04 15:26:23,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:23,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:23,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:26:23,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:26:23,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:23,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:23,183 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:26:23,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:23,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506763292] [2025-03-04 15:26:23,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506763292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:23,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921167774] [2025-03-04 15:26:23,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:23,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:23,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:23,186 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:23,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:26:23,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:26:23,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:26:23,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:23,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:23,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:23,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:23,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:23,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921167774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:23,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:23,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:26:23,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110690011] [2025-03-04 15:26:23,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:23,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:26:23,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:23,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:26:23,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:26:23,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 81 [2025-03-04 15:26:23,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 133 transitions, 773 flow. Second operand has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 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:26:23,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:23,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 81 [2025-03-04 15:26:23,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:23,431 INFO L124 PetriNetUnfolderBase]: 380/1051 cut-off events. [2025-03-04 15:26:23,432 INFO L125 PetriNetUnfolderBase]: For 953/953 co-relation queries the response was YES. [2025-03-04 15:26:23,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2930 conditions, 1051 events. 380/1051 cut-off events. For 953/953 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6360 event pairs, 242 based on Foata normal form. 2/913 useless extension candidates. Maximal degree in co-relation 2659. Up to 655 conditions per place. [2025-03-04 15:26:23,437 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 84 selfloop transitions, 27 changer transitions 0/145 dead transitions. [2025-03-04 15:26:23,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 145 transitions, 1092 flow [2025-03-04 15:26:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 301 transitions. [2025-03-04 15:26:23,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6193415637860082 [2025-03-04 15:26:23,438 INFO L175 Difference]: Start difference. First operand has 114 places, 133 transitions, 773 flow. Second operand 6 states and 301 transitions. [2025-03-04 15:26:23,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 145 transitions, 1092 flow [2025-03-04 15:26:23,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 145 transitions, 1065 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:23,444 INFO L231 Difference]: Finished difference. Result has 115 places, 132 transitions, 800 flow [2025-03-04 15:26:23,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=800, PETRI_PLACES=115, PETRI_TRANSITIONS=132} [2025-03-04 15:26:23,445 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 38 predicate places. [2025-03-04 15:26:23,445 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 132 transitions, 800 flow [2025-03-04 15:26:23,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 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:26:23,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:23,445 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:23,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:23,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:23,646 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:23,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:23,647 INFO L85 PathProgramCache]: Analyzing trace with hash 195477665, now seen corresponding path program 1 times [2025-03-04 15:26:23,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:23,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350354393] [2025-03-04 15:26:23,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:23,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:23,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:26:23,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:26:23,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:23,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:23,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:23,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350354393] [2025-03-04 15:26:23,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350354393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:23,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358660550] [2025-03-04 15:26:23,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:23,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:23,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:23,729 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:23,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:26:23,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:26:23,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:26:23,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:23,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:23,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:23,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:23,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:23,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358660550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:23,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:23,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:26:23,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840621874] [2025-03-04 15:26:23,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:23,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:26:23,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:23,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:26:23,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:26:23,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 81 [2025-03-04 15:26:23,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 132 transitions, 800 flow. Second operand has 12 states, 12 states have (on average 44.916666666666664) internal successors, (539), 12 states have internal predecessors, (539), 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:26:23,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:23,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 81 [2025-03-04 15:26:23,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:24,083 INFO L124 PetriNetUnfolderBase]: 416/1201 cut-off events. [2025-03-04 15:26:24,083 INFO L125 PetriNetUnfolderBase]: For 1249/1249 co-relation queries the response was YES. [2025-03-04 15:26:24,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3547 conditions, 1201 events. 416/1201 cut-off events. For 1249/1249 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 7299 event pairs, 242 based on Foata normal form. 6/1069 useless extension candidates. Maximal degree in co-relation 3040. Up to 699 conditions per place. [2025-03-04 15:26:24,089 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 131 selfloop transitions, 43 changer transitions 0/208 dead transitions. [2025-03-04 15:26:24,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 208 transitions, 1752 flow [2025-03-04 15:26:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:26:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:26:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 493 transitions. [2025-03-04 15:26:24,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.608641975308642 [2025-03-04 15:26:24,090 INFO L175 Difference]: Start difference. First operand has 115 places, 132 transitions, 800 flow. Second operand 10 states and 493 transitions. [2025-03-04 15:26:24,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 208 transitions, 1752 flow [2025-03-04 15:26:24,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 208 transitions, 1637 flow, removed 28 selfloop flow, removed 4 redundant places. [2025-03-04 15:26:24,097 INFO L231 Difference]: Finished difference. Result has 123 places, 156 transitions, 1030 flow [2025-03-04 15:26:24,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1030, PETRI_PLACES=123, PETRI_TRANSITIONS=156} [2025-03-04 15:26:24,097 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 46 predicate places. [2025-03-04 15:26:24,097 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 156 transitions, 1030 flow [2025-03-04 15:26:24,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 44.916666666666664) internal successors, (539), 12 states have internal predecessors, (539), 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:26:24,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:24,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:24,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:26:24,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 15:26:24,299 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:24,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:24,299 INFO L85 PathProgramCache]: Analyzing trace with hash -557883040, now seen corresponding path program 1 times [2025-03-04 15:26:24,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:24,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403249375] [2025-03-04 15:26:24,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:24,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:24,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:26:24,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:26:24,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:24,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:24,359 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:26:24,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:24,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403249375] [2025-03-04 15:26:24,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403249375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:24,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:24,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:26:24,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607940891] [2025-03-04 15:26:24,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:24,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:24,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:24,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:24,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:24,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 81 [2025-03-04 15:26:24,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 156 transitions, 1030 flow. Second operand has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 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:26:24,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:24,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 81 [2025-03-04 15:26:24,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:24,563 INFO L124 PetriNetUnfolderBase]: 414/1173 cut-off events. [2025-03-04 15:26:24,563 INFO L125 PetriNetUnfolderBase]: For 1236/1236 co-relation queries the response was YES. [2025-03-04 15:26:24,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3515 conditions, 1173 events. 414/1173 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6912 event pairs, 242 based on Foata normal form. 2/1053 useless extension candidates. Maximal degree in co-relation 3220. Up to 590 conditions per place. [2025-03-04 15:26:24,570 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 161 selfloop transitions, 10 changer transitions 6/210 dead transitions. [2025-03-04 15:26:24,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 210 transitions, 1730 flow [2025-03-04 15:26:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 269 transitions. [2025-03-04 15:26:24,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6641975308641975 [2025-03-04 15:26:24,572 INFO L175 Difference]: Start difference. First operand has 123 places, 156 transitions, 1030 flow. Second operand 5 states and 269 transitions. [2025-03-04 15:26:24,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 210 transitions, 1730 flow [2025-03-04 15:26:24,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 210 transitions, 1700 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:24,580 INFO L231 Difference]: Finished difference. Result has 125 places, 155 transitions, 1013 flow [2025-03-04 15:26:24,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1013, PETRI_PLACES=125, PETRI_TRANSITIONS=155} [2025-03-04 15:26:24,581 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 48 predicate places. [2025-03-04 15:26:24,581 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 155 transitions, 1013 flow [2025-03-04 15:26:24,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 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:26:24,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:24,581 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:24,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:26:24,581 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:24,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:24,581 INFO L85 PathProgramCache]: Analyzing trace with hash -125850822, now seen corresponding path program 2 times [2025-03-04 15:26:24,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:24,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099336991] [2025-03-04 15:26:24,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:24,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:24,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 15:26:24,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 20 statements. [2025-03-04 15:26:24,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:24,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:24,620 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:26:24,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:24,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099336991] [2025-03-04 15:26:24,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099336991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:24,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211415894] [2025-03-04 15:26:24,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:24,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:24,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:24,622 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:24,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:26:24,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 15:26:24,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 20 statements. [2025-03-04 15:26:24,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:24,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:24,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:26:24,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:25,500 WARN L873 $PredicateComparison]: unable to prove that (exists ((~M~0 Int) (~N~0 Int)) (let ((.cse0 (* ~N~0 ~M~0))) (and (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| .cse0) (<= .cse0 2147483647)))) is different from true [2025-03-04 15:26:26,441 WARN L873 $PredicateComparison]: unable to prove that (exists ((~M~0 Int) (~N~0 Int)) (let ((.cse0 (* ~N~0 ~M~0))) (and (<= .cse0 2147483647) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post26#1| 1) .cse0)))) is different from true [2025-03-04 15:26:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 8 not checked. [2025-03-04 15:26:26,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:26,479 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:26:26,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211415894] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:26,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:26,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 15:26:26,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994077308] [2025-03-04 15:26:26,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:26,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:26:26,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:26,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:26:26,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=9, Unknown=2, NotChecked=10, Total=30 [2025-03-04 15:26:26,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 81 [2025-03-04 15:26:26,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 155 transitions, 1013 flow. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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:26:26,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:26,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 81 [2025-03-04 15:26:26,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:27,485 INFO L124 PetriNetUnfolderBase]: 414/1289 cut-off events. [2025-03-04 15:26:27,486 INFO L125 PetriNetUnfolderBase]: For 1146/1146 co-relation queries the response was YES. [2025-03-04 15:26:27,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3697 conditions, 1289 events. 414/1289 cut-off events. For 1146/1146 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8279 event pairs, 242 based on Foata normal form. 2/1123 useless extension candidates. Maximal degree in co-relation 3391. Up to 909 conditions per place. [2025-03-04 15:26:27,500 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 109 selfloop transitions, 16 changer transitions 0/154 dead transitions. [2025-03-04 15:26:27,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 154 transitions, 1253 flow [2025-03-04 15:26:27,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:27,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2025-03-04 15:26:27,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5709876543209876 [2025-03-04 15:26:27,501 INFO L175 Difference]: Start difference. First operand has 125 places, 155 transitions, 1013 flow. Second operand 4 states and 185 transitions. [2025-03-04 15:26:27,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 154 transitions, 1253 flow [2025-03-04 15:26:27,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 154 transitions, 1223 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 15:26:27,510 INFO L231 Difference]: Finished difference. Result has 123 places, 154 transitions, 1005 flow [2025-03-04 15:26:27,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1005, PETRI_PLACES=123, PETRI_TRANSITIONS=154} [2025-03-04 15:26:27,512 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 46 predicate places. [2025-03-04 15:26:27,512 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 154 transitions, 1005 flow [2025-03-04 15:26:27,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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:26:27,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:27,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:27,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 15:26:27,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 15:26:27,714 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:27,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:27,715 INFO L85 PathProgramCache]: Analyzing trace with hash 929255967, now seen corresponding path program 1 times [2025-03-04 15:26:27,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:27,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056752523] [2025-03-04 15:26:27,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:27,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:27,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:26:27,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:26:27,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:27,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:27,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:27,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056752523] [2025-03-04 15:26:27,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056752523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:27,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:27,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:27,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300460307] [2025-03-04 15:26:27,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:27,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:27,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:27,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:27,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:27,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 81 [2025-03-04 15:26:27,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 154 transitions, 1005 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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:26:27,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:27,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 81 [2025-03-04 15:26:27,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:28,024 INFO L124 PetriNetUnfolderBase]: 715/1864 cut-off events. [2025-03-04 15:26:28,025 INFO L125 PetriNetUnfolderBase]: For 1810/1856 co-relation queries the response was YES. [2025-03-04 15:26:28,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4986 conditions, 1864 events. 715/1864 cut-off events. For 1810/1856 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 11911 event pairs, 317 based on Foata normal form. 60/1696 useless extension candidates. Maximal degree in co-relation 4693. Up to 1014 conditions per place. [2025-03-04 15:26:28,033 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 147 selfloop transitions, 6 changer transitions 0/183 dead transitions. [2025-03-04 15:26:28,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 183 transitions, 1443 flow [2025-03-04 15:26:28,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2025-03-04 15:26:28,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6975308641975309 [2025-03-04 15:26:28,035 INFO L175 Difference]: Start difference. First operand has 123 places, 154 transitions, 1005 flow. Second operand 4 states and 226 transitions. [2025-03-04 15:26:28,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 183 transitions, 1443 flow [2025-03-04 15:26:28,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 183 transitions, 1411 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:28,041 INFO L231 Difference]: Finished difference. Result has 125 places, 157 transitions, 1014 flow [2025-03-04 15:26:28,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1014, PETRI_PLACES=125, PETRI_TRANSITIONS=157} [2025-03-04 15:26:28,042 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 48 predicate places. [2025-03-04 15:26:28,042 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 157 transitions, 1014 flow [2025-03-04 15:26:28,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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:26:28,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:28,043 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:28,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:26:28,043 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:28,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:28,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1950622102, now seen corresponding path program 1 times [2025-03-04 15:26:28,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:28,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390536543] [2025-03-04 15:26:28,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:28,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:28,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:26:28,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:26:28,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:28,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:28,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:28,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390536543] [2025-03-04 15:26:28,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390536543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:28,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309217189] [2025-03-04 15:26:28,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:28,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:28,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:28,118 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:28,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:26:28,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:26:28,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:26:28,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:28,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:28,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:26:28,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:28,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:28,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309217189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:28,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:28,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 15:26:28,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608497475] [2025-03-04 15:26:28,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:28,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:26:28,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:28,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:26:28,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:26:28,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 81 [2025-03-04 15:26:28,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 157 transitions, 1014 flow. Second operand has 19 states, 19 states have (on average 39.0) internal successors, (741), 19 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:28,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:28,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 81 [2025-03-04 15:26:28,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:29,274 INFO L124 PetriNetUnfolderBase]: 972/2415 cut-off events. [2025-03-04 15:26:29,274 INFO L125 PetriNetUnfolderBase]: For 2595/2617 co-relation queries the response was YES. [2025-03-04 15:26:29,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7154 conditions, 2415 events. 972/2415 cut-off events. For 2595/2617 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 15638 event pairs, 207 based on Foata normal form. 34/2314 useless extension candidates. Maximal degree in co-relation 6723. Up to 669 conditions per place. [2025-03-04 15:26:29,285 INFO L140 encePairwiseOnDemand]: 66/81 looper letters, 258 selfloop transitions, 58 changer transitions 14/360 dead transitions. [2025-03-04 15:26:29,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 360 transitions, 2862 flow [2025-03-04 15:26:29,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:26:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:26:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 798 transitions. [2025-03-04 15:26:29,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.579520697167756 [2025-03-04 15:26:29,287 INFO L175 Difference]: Start difference. First operand has 125 places, 157 transitions, 1014 flow. Second operand 17 states and 798 transitions. [2025-03-04 15:26:29,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 360 transitions, 2862 flow [2025-03-04 15:26:29,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 360 transitions, 2817 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:29,301 INFO L231 Difference]: Finished difference. Result has 141 places, 181 transitions, 1372 flow [2025-03-04 15:26:29,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1372, PETRI_PLACES=141, PETRI_TRANSITIONS=181} [2025-03-04 15:26:29,301 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 64 predicate places. [2025-03-04 15:26:29,301 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 181 transitions, 1372 flow [2025-03-04 15:26:29,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 39.0) internal successors, (741), 19 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:29,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:29,302 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:29,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:29,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 15:26:29,503 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:29,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:29,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1528118140, now seen corresponding path program 1 times [2025-03-04 15:26:29,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:29,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198968638] [2025-03-04 15:26:29,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:29,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:29,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:26:29,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:26:29,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:29,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 15:26:29,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:29,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198968638] [2025-03-04 15:26:29,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198968638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:29,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:29,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:26:29,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490888697] [2025-03-04 15:26:29,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:29,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:29,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:29,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:29,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:29,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 81 [2025-03-04 15:26:29,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 181 transitions, 1372 flow. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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:26:29,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:29,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 81 [2025-03-04 15:26:29,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:29,892 INFO L124 PetriNetUnfolderBase]: 886/2343 cut-off events. [2025-03-04 15:26:29,892 INFO L125 PetriNetUnfolderBase]: For 3842/3847 co-relation queries the response was YES. [2025-03-04 15:26:29,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7392 conditions, 2343 events. 886/2343 cut-off events. For 3842/3847 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 15916 event pairs, 551 based on Foata normal form. 2/2236 useless extension candidates. Maximal degree in co-relation 6924. Up to 1624 conditions per place. [2025-03-04 15:26:29,903 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 135 selfloop transitions, 12 changer transitions 0/180 dead transitions. [2025-03-04 15:26:29,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 180 transitions, 1654 flow [2025-03-04 15:26:29,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2025-03-04 15:26:29,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6882716049382716 [2025-03-04 15:26:29,904 INFO L175 Difference]: Start difference. First operand has 141 places, 181 transitions, 1372 flow. Second operand 4 states and 223 transitions. [2025-03-04 15:26:29,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 180 transitions, 1654 flow [2025-03-04 15:26:29,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 180 transitions, 1600 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-04 15:26:29,917 INFO L231 Difference]: Finished difference. Result has 140 places, 180 transitions, 1334 flow [2025-03-04 15:26:29,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1334, PETRI_PLACES=140, PETRI_TRANSITIONS=180} [2025-03-04 15:26:29,918 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 63 predicate places. [2025-03-04 15:26:29,918 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 180 transitions, 1334 flow [2025-03-04 15:26:29,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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:26:29,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:29,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:29,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:26:29,918 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:29,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:29,919 INFO L85 PathProgramCache]: Analyzing trace with hash -338223998, now seen corresponding path program 1 times [2025-03-04 15:26:29,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:29,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671483724] [2025-03-04 15:26:29,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:29,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:29,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:26:29,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:26:29,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:29,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:29,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:29,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671483724] [2025-03-04 15:26:29,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671483724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:29,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:29,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:29,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325804437] [2025-03-04 15:26:29,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:29,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:29,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:29,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:29,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:29,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 81 [2025-03-04 15:26:29,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 180 transitions, 1334 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:29,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:29,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 81 [2025-03-04 15:26:29,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:30,311 INFO L124 PetriNetUnfolderBase]: 2028/4339 cut-off events. [2025-03-04 15:26:30,311 INFO L125 PetriNetUnfolderBase]: For 4230/4297 co-relation queries the response was YES. [2025-03-04 15:26:30,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11702 conditions, 4339 events. 2028/4339 cut-off events. For 4230/4297 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 28493 event pairs, 941 based on Foata normal form. 0/4008 useless extension candidates. Maximal degree in co-relation 11235. Up to 2464 conditions per place. [2025-03-04 15:26:30,332 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 190 selfloop transitions, 5 changer transitions 0/222 dead transitions. [2025-03-04 15:26:30,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 222 transitions, 1896 flow [2025-03-04 15:26:30,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:30,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2025-03-04 15:26:30,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2025-03-04 15:26:30,334 INFO L175 Difference]: Start difference. First operand has 140 places, 180 transitions, 1334 flow. Second operand 4 states and 219 transitions. [2025-03-04 15:26:30,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 222 transitions, 1896 flow [2025-03-04 15:26:30,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 222 transitions, 1874 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:30,347 INFO L231 Difference]: Finished difference. Result has 143 places, 184 transitions, 1352 flow [2025-03-04 15:26:30,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1352, PETRI_PLACES=143, PETRI_TRANSITIONS=184} [2025-03-04 15:26:30,347 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 66 predicate places. [2025-03-04 15:26:30,347 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 184 transitions, 1352 flow [2025-03-04 15:26:30,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:30,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:30,348 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:30,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:26:30,348 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:30,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:30,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1668804305, now seen corresponding path program 1 times [2025-03-04 15:26:30,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:30,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135421791] [2025-03-04 15:26:30,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:30,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:30,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:26:30,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:26:30,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:30,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:26:30,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:30,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135421791] [2025-03-04 15:26:30,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135421791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:30,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060658174] [2025-03-04 15:26:30,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:30,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:30,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:30,522 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:30,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:26:30,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:26:30,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:26:30,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:30,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:30,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 15:26:30,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:26:30,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 15:26:30,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060658174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:30,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:30,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-04 15:26:30,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974116237] [2025-03-04 15:26:30,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:30,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 15:26:30,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:30,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 15:26:30,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:26:30,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 81 [2025-03-04 15:26:30,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 184 transitions, 1352 flow. Second operand has 21 states, 21 states have (on average 40.38095238095238) internal successors, (848), 21 states have internal predecessors, (848), 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:26:30,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:30,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 81 [2025-03-04 15:26:30,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:31,365 INFO L124 PetriNetUnfolderBase]: 1166/2813 cut-off events. [2025-03-04 15:26:31,366 INFO L125 PetriNetUnfolderBase]: For 3557/3562 co-relation queries the response was YES. [2025-03-04 15:26:31,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8277 conditions, 2813 events. 1166/2813 cut-off events. For 3557/3562 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 18965 event pairs, 756 based on Foata normal form. 2/2695 useless extension candidates. Maximal degree in co-relation 7805. Up to 1921 conditions per place. [2025-03-04 15:26:31,376 INFO L140 encePairwiseOnDemand]: 69/81 looper letters, 78 selfloop transitions, 69 changer transitions 0/179 dead transitions. [2025-03-04 15:26:31,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 179 transitions, 1601 flow [2025-03-04 15:26:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:26:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:26:31,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 605 transitions. [2025-03-04 15:26:31,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5335097001763669 [2025-03-04 15:26:31,378 INFO L175 Difference]: Start difference. First operand has 143 places, 184 transitions, 1352 flow. Second operand 14 states and 605 transitions. [2025-03-04 15:26:31,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 179 transitions, 1601 flow [2025-03-04 15:26:31,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 179 transitions, 1597 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:31,388 INFO L231 Difference]: Finished difference. Result has 155 places, 179 transitions, 1441 flow [2025-03-04 15:26:31,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1441, PETRI_PLACES=155, PETRI_TRANSITIONS=179} [2025-03-04 15:26:31,389 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 78 predicate places. [2025-03-04 15:26:31,389 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 179 transitions, 1441 flow [2025-03-04 15:26:31,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 40.38095238095238) internal successors, (848), 21 states have internal predecessors, (848), 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:26:31,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:31,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:31,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:31,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 15:26:31,590 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:31,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:31,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1895008685, now seen corresponding path program 1 times [2025-03-04 15:26:31,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:31,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986556350] [2025-03-04 15:26:31,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:31,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:26:31,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:26:31,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:31,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:31,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:31,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986556350] [2025-03-04 15:26:31,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986556350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:31,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:31,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:31,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964014803] [2025-03-04 15:26:31,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:31,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:31,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:31,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:31,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:31,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 81 [2025-03-04 15:26:31,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 179 transitions, 1441 flow. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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:26:31,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:31,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 81 [2025-03-04 15:26:31,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:32,136 INFO L124 PetriNetUnfolderBase]: 1706/3881 cut-off events. [2025-03-04 15:26:32,137 INFO L125 PetriNetUnfolderBase]: For 4585/4649 co-relation queries the response was YES. [2025-03-04 15:26:32,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11038 conditions, 3881 events. 1706/3881 cut-off events. For 4585/4649 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 26272 event pairs, 834 based on Foata normal form. 0/3682 useless extension candidates. Maximal degree in co-relation 10530. Up to 2212 conditions per place. [2025-03-04 15:26:32,153 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 181 selfloop transitions, 6 changer transitions 0/216 dead transitions. [2025-03-04 15:26:32,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 216 transitions, 1971 flow [2025-03-04 15:26:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2025-03-04 15:26:32,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6790123456790124 [2025-03-04 15:26:32,158 INFO L175 Difference]: Start difference. First operand has 155 places, 179 transitions, 1441 flow. Second operand 4 states and 220 transitions. [2025-03-04 15:26:32,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 216 transitions, 1971 flow [2025-03-04 15:26:32,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 216 transitions, 1853 flow, removed 3 selfloop flow, removed 12 redundant places. [2025-03-04 15:26:32,170 INFO L231 Difference]: Finished difference. Result has 148 places, 181 transitions, 1355 flow [2025-03-04 15:26:32,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1355, PETRI_PLACES=148, PETRI_TRANSITIONS=181} [2025-03-04 15:26:32,171 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 71 predicate places. [2025-03-04 15:26:32,171 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 181 transitions, 1355 flow [2025-03-04 15:26:32,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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:26:32,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:32,171 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:32,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:26:32,171 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:32,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:32,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2108379788, now seen corresponding path program 1 times [2025-03-04 15:26:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:32,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893631084] [2025-03-04 15:26:32,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:32,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:32,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:26:32,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:26:32,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:32,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:32,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:32,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893631084] [2025-03-04 15:26:32,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893631084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:32,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136016103] [2025-03-04 15:26:32,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:32,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:32,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:32,319 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:32,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:26:32,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:26:32,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:26:32,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:32,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:32,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 15:26:32,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:32,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136016103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:32,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:32,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-04 15:26:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083613445] [2025-03-04 15:26:32,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:32,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 15:26:32,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:32,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 15:26:32,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-04 15:26:32,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 81 [2025-03-04 15:26:32,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 181 transitions, 1355 flow. Second operand has 24 states, 24 states have (on average 40.291666666666664) internal successors, (967), 24 states have internal predecessors, (967), 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:26:32,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:32,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 81 [2025-03-04 15:26:32,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:33,055 INFO L124 PetriNetUnfolderBase]: 1280/3249 cut-off events. [2025-03-04 15:26:33,055 INFO L125 PetriNetUnfolderBase]: For 6764/6769 co-relation queries the response was YES. [2025-03-04 15:26:33,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10758 conditions, 3249 events. 1280/3249 cut-off events. For 6764/6769 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 22403 event pairs, 756 based on Foata normal form. 102/3231 useless extension candidates. Maximal degree in co-relation 9837. Up to 2015 conditions per place. [2025-03-04 15:26:33,069 INFO L140 encePairwiseOnDemand]: 68/81 looper letters, 69 selfloop transitions, 174 changer transitions 0/277 dead transitions. [2025-03-04 15:26:33,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 277 transitions, 2831 flow [2025-03-04 15:26:33,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 15:26:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 15:26:33,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 997 transitions. [2025-03-04 15:26:33,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5594837261503928 [2025-03-04 15:26:33,071 INFO L175 Difference]: Start difference. First operand has 148 places, 181 transitions, 1355 flow. Second operand 22 states and 997 transitions. [2025-03-04 15:26:33,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 277 transitions, 2831 flow [2025-03-04 15:26:33,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 277 transitions, 2827 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:33,088 INFO L231 Difference]: Finished difference. Result has 174 places, 277 transitions, 2791 flow [2025-03-04 15:26:33,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=1351, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2791, PETRI_PLACES=174, PETRI_TRANSITIONS=277} [2025-03-04 15:26:33,088 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 97 predicate places. [2025-03-04 15:26:33,088 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 277 transitions, 2791 flow [2025-03-04 15:26:33,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 40.291666666666664) internal successors, (967), 24 states have internal predecessors, (967), 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:26:33,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:33,089 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:33,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:33,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 15:26:33,289 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:33,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1414827254, now seen corresponding path program 1 times [2025-03-04 15:26:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:33,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196742046] [2025-03-04 15:26:33,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:33,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:33,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:26:33,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:26:33,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:33,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:33,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:33,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196742046] [2025-03-04 15:26:33,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196742046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:33,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:33,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:26:33,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775333552] [2025-03-04 15:26:33,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:33,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:33,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:33,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:33,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:33,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 81 [2025-03-04 15:26:33,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 277 transitions, 2791 flow. Second operand has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 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:26:33,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:33,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 81 [2025-03-04 15:26:33,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:33,939 INFO L124 PetriNetUnfolderBase]: 1843/4826 cut-off events. [2025-03-04 15:26:33,939 INFO L125 PetriNetUnfolderBase]: For 11464/11498 co-relation queries the response was YES. [2025-03-04 15:26:33,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17695 conditions, 4826 events. 1843/4826 cut-off events. For 11464/11498 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 35756 event pairs, 984 based on Foata normal form. 65/4730 useless extension candidates. Maximal degree in co-relation 16669. Up to 2357 conditions per place. [2025-03-04 15:26:33,958 INFO L140 encePairwiseOnDemand]: 74/81 looper letters, 355 selfloop transitions, 33 changer transitions 1/425 dead transitions. [2025-03-04 15:26:33,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 425 transitions, 5053 flow [2025-03-04 15:26:33,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 340 transitions. [2025-03-04 15:26:33,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6995884773662552 [2025-03-04 15:26:33,959 INFO L175 Difference]: Start difference. First operand has 174 places, 277 transitions, 2791 flow. Second operand 6 states and 340 transitions. [2025-03-04 15:26:33,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 425 transitions, 5053 flow [2025-03-04 15:26:33,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 425 transitions, 4413 flow, removed 197 selfloop flow, removed 9 redundant places. [2025-03-04 15:26:33,999 INFO L231 Difference]: Finished difference. Result has 172 places, 293 transitions, 2651 flow [2025-03-04 15:26:33,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2365, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2651, PETRI_PLACES=172, PETRI_TRANSITIONS=293} [2025-03-04 15:26:33,999 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 95 predicate places. [2025-03-04 15:26:33,999 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 293 transitions, 2651 flow [2025-03-04 15:26:34,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 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:26:34,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:34,000 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:34,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 15:26:34,000 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:34,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1414827287, now seen corresponding path program 1 times [2025-03-04 15:26:34,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:34,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441524669] [2025-03-04 15:26:34,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:34,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:34,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:26:34,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:26:34,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:34,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:34,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:34,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441524669] [2025-03-04 15:26:34,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441524669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:34,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908082141] [2025-03-04 15:26:34,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:34,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:34,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:34,060 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:34,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:26:34,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:26:34,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:26:34,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:34,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:34,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:26:34,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:34,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:34,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908082141] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:34,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:34,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 16 [2025-03-04 15:26:34,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690373145] [2025-03-04 15:26:34,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:34,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 15:26:34,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:34,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 15:26:34,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:26:34,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 81 [2025-03-04 15:26:34,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 293 transitions, 2651 flow. Second operand has 16 states, 16 states have (on average 39.5) internal successors, (632), 16 states have internal predecessors, (632), 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:26:34,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:34,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 81 [2025-03-04 15:26:34,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:35,601 INFO L124 PetriNetUnfolderBase]: 2996/7529 cut-off events. [2025-03-04 15:26:35,601 INFO L125 PetriNetUnfolderBase]: For 12535/12601 co-relation queries the response was YES. [2025-03-04 15:26:35,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24581 conditions, 7529 events. 2996/7529 cut-off events. For 12535/12601 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 60075 event pairs, 327 based on Foata normal form. 124/7387 useless extension candidates. Maximal degree in co-relation 23637. Up to 1150 conditions per place. [2025-03-04 15:26:35,637 INFO L140 encePairwiseOnDemand]: 71/81 looper letters, 453 selfloop transitions, 59 changer transitions 0/542 dead transitions. [2025-03-04 15:26:35,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 542 transitions, 5481 flow [2025-03-04 15:26:35,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:26:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:26:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 603 transitions. [2025-03-04 15:26:35,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5726495726495726 [2025-03-04 15:26:35,638 INFO L175 Difference]: Start difference. First operand has 172 places, 293 transitions, 2651 flow. Second operand 13 states and 603 transitions. [2025-03-04 15:26:35,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 542 transitions, 5481 flow [2025-03-04 15:26:35,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 542 transitions, 5481 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:26:35,699 INFO L231 Difference]: Finished difference. Result has 184 places, 299 transitions, 2827 flow [2025-03-04 15:26:35,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2647, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2827, PETRI_PLACES=184, PETRI_TRANSITIONS=299} [2025-03-04 15:26:35,700 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 107 predicate places. [2025-03-04 15:26:35,700 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 299 transitions, 2827 flow [2025-03-04 15:26:35,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 39.5) internal successors, (632), 16 states have internal predecessors, (632), 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:26:35,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:35,700 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:35,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:35,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 15:26:35,901 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:35,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:35,902 INFO L85 PathProgramCache]: Analyzing trace with hash -867691677, now seen corresponding path program 1 times [2025-03-04 15:26:35,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:35,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835086176] [2025-03-04 15:26:35,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:35,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:35,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:26:35,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:26:35,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:35,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:35,970 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 15:26:35,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:35,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835086176] [2025-03-04 15:26:35,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835086176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:35,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905577374] [2025-03-04 15:26:35,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:35,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:35,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:35,974 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:35,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 15:26:36,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:26:36,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:26:36,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:36,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:36,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:36,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 15:26:36,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 15:26:36,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905577374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:36,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:36,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:26:36,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189416786] [2025-03-04 15:26:36,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:36,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:26:36,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:36,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:26:36,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:26:36,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 81 [2025-03-04 15:26:36,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 299 transitions, 2827 flow. Second operand has 12 states, 12 states have (on average 45.0) internal successors, (540), 12 states have internal predecessors, (540), 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:26:36,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:36,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 81 [2025-03-04 15:26:36,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:37,209 INFO L124 PetriNetUnfolderBase]: 4166/9140 cut-off events. [2025-03-04 15:26:37,209 INFO L125 PetriNetUnfolderBase]: For 24032/24072 co-relation queries the response was YES. [2025-03-04 15:26:37,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31557 conditions, 9140 events. 4166/9140 cut-off events. For 24032/24072 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 68999 event pairs, 1059 based on Foata normal form. 306/9301 useless extension candidates. Maximal degree in co-relation 30186. Up to 4073 conditions per place. [2025-03-04 15:26:37,259 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 486 selfloop transitions, 20 changer transitions 0/540 dead transitions. [2025-03-04 15:26:37,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 540 transitions, 5883 flow [2025-03-04 15:26:37,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:26:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:26:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 569 transitions. [2025-03-04 15:26:37,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7024691358024692 [2025-03-04 15:26:37,261 INFO L175 Difference]: Start difference. First operand has 184 places, 299 transitions, 2827 flow. Second operand 10 states and 569 transitions. [2025-03-04 15:26:37,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 540 transitions, 5883 flow [2025-03-04 15:26:37,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 540 transitions, 5615 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-04 15:26:37,334 INFO L231 Difference]: Finished difference. Result has 191 places, 308 transitions, 2845 flow [2025-03-04 15:26:37,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2751, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2845, PETRI_PLACES=191, PETRI_TRANSITIONS=308} [2025-03-04 15:26:37,334 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 114 predicate places. [2025-03-04 15:26:37,334 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 308 transitions, 2845 flow [2025-03-04 15:26:37,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 45.0) internal successors, (540), 12 states have internal predecessors, (540), 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:26:37,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:37,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:37,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:37,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:37,535 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:37,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash 417053928, now seen corresponding path program 1 times [2025-03-04 15:26:37,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:37,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273984077] [2025-03-04 15:26:37,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:37,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:37,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:26:37,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:26:37,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:37,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:37,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:37,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273984077] [2025-03-04 15:26:37,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273984077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:37,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:37,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:37,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513964821] [2025-03-04 15:26:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:37,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:37,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:37,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:37,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:37,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 81 [2025-03-04 15:26:37,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 308 transitions, 2845 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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:26:37,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:37,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 81 [2025-03-04 15:26:37,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:38,739 INFO L124 PetriNetUnfolderBase]: 4418/9970 cut-off events. [2025-03-04 15:26:38,739 INFO L125 PetriNetUnfolderBase]: For 23830/23888 co-relation queries the response was YES. [2025-03-04 15:26:38,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35992 conditions, 9970 events. 4418/9970 cut-off events. For 23830/23888 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 77672 event pairs, 2199 based on Foata normal form. 258/10195 useless extension candidates. Maximal degree in co-relation 34622. Up to 6237 conditions per place. [2025-03-04 15:26:38,801 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 317 selfloop transitions, 10 changer transitions 0/360 dead transitions. [2025-03-04 15:26:38,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 360 transitions, 3823 flow [2025-03-04 15:26:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 227 transitions. [2025-03-04 15:26:38,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7006172839506173 [2025-03-04 15:26:38,802 INFO L175 Difference]: Start difference. First operand has 191 places, 308 transitions, 2845 flow. Second operand 4 states and 227 transitions. [2025-03-04 15:26:38,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 360 transitions, 3823 flow [2025-03-04 15:26:38,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 360 transitions, 3769 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:38,902 INFO L231 Difference]: Finished difference. Result has 194 places, 309 transitions, 2866 flow [2025-03-04 15:26:38,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2827, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2866, PETRI_PLACES=194, PETRI_TRANSITIONS=309} [2025-03-04 15:26:38,902 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 117 predicate places. [2025-03-04 15:26:38,903 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 309 transitions, 2866 flow [2025-03-04 15:26:38,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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:26:38,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:38,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:38,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 15:26:38,903 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:38,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:38,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1081360217, now seen corresponding path program 1 times [2025-03-04 15:26:38,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:38,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905675803] [2025-03-04 15:26:38,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:38,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:38,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 15:26:38,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 15:26:38,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:38,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:26:38,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:38,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905675803] [2025-03-04 15:26:38,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905675803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:38,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:38,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:26:38,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755123697] [2025-03-04 15:26:38,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:38,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:38,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:38,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:38,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:38,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 81 [2025-03-04 15:26:38,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 309 transitions, 2866 flow. Second operand has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 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:26:38,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:38,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 81 [2025-03-04 15:26:38,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:39,965 INFO L124 PetriNetUnfolderBase]: 4108/9709 cut-off events. [2025-03-04 15:26:39,965 INFO L125 PetriNetUnfolderBase]: For 25340/25411 co-relation queries the response was YES. [2025-03-04 15:26:39,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35364 conditions, 9709 events. 4108/9709 cut-off events. For 25340/25411 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 78430 event pairs, 1515 based on Foata normal form. 180/9858 useless extension candidates. Maximal degree in co-relation 33991. Up to 4221 conditions per place. [2025-03-04 15:26:40,014 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 371 selfloop transitions, 7 changer transitions 11/419 dead transitions. [2025-03-04 15:26:40,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 419 transitions, 4534 flow [2025-03-04 15:26:40,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 268 transitions. [2025-03-04 15:26:40,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6617283950617284 [2025-03-04 15:26:40,015 INFO L175 Difference]: Start difference. First operand has 194 places, 309 transitions, 2866 flow. Second operand 5 states and 268 transitions. [2025-03-04 15:26:40,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 419 transitions, 4534 flow [2025-03-04 15:26:40,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 419 transitions, 4515 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:40,116 INFO L231 Difference]: Finished difference. Result has 195 places, 307 transitions, 2852 flow [2025-03-04 15:26:40,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2838, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2852, PETRI_PLACES=195, PETRI_TRANSITIONS=307} [2025-03-04 15:26:40,117 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 118 predicate places. [2025-03-04 15:26:40,117 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 307 transitions, 2852 flow [2025-03-04 15:26:40,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 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:26:40,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:40,117 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:40,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 15:26:40,117 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:40,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1061360546, now seen corresponding path program 2 times [2025-03-04 15:26:40,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:40,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380533640] [2025-03-04 15:26:40,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:40,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:40,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 15:26:40,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 29 statements. [2025-03-04 15:26:40,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:40,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 15:26:40,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:40,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380533640] [2025-03-04 15:26:40,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380533640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:40,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46422028] [2025-03-04 15:26:40,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:40,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:40,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:40,157 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:40,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 15:26:40,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 15:26:40,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 29 statements. [2025-03-04 15:26:40,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:40,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:40,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:26:40,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 15:26:40,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 15:26:40,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46422028] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:40,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:40,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-04 15:26:40,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811622464] [2025-03-04 15:26:40,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:40,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:40,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:40,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:40,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:40,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 81 [2025-03-04 15:26:40,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 307 transitions, 2852 flow. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 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:26:40,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:40,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 81 [2025-03-04 15:26:40,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:41,438 INFO L124 PetriNetUnfolderBase]: 3832/9041 cut-off events. [2025-03-04 15:26:41,438 INFO L125 PetriNetUnfolderBase]: For 26018/26026 co-relation queries the response was YES. [2025-03-04 15:26:41,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33308 conditions, 9041 events. 3832/9041 cut-off events. For 26018/26026 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 71725 event pairs, 2541 based on Foata normal form. 6/8922 useless extension candidates. Maximal degree in co-relation 31935. Up to 5795 conditions per place. [2025-03-04 15:26:41,510 INFO L140 encePairwiseOnDemand]: 74/81 looper letters, 171 selfloop transitions, 102 changer transitions 0/307 dead transitions. [2025-03-04 15:26:41,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 307 transitions, 3399 flow [2025-03-04 15:26:41,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:41,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2025-03-04 15:26:41,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 15:26:41,511 INFO L175 Difference]: Start difference. First operand has 195 places, 307 transitions, 2852 flow. Second operand 5 states and 243 transitions. [2025-03-04 15:26:41,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 307 transitions, 3399 flow [2025-03-04 15:26:41,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 307 transitions, 3323 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-03-04 15:26:41,609 INFO L231 Difference]: Finished difference. Result has 191 places, 307 transitions, 3017 flow [2025-03-04 15:26:41,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2766, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3017, PETRI_PLACES=191, PETRI_TRANSITIONS=307} [2025-03-04 15:26:41,610 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 114 predicate places. [2025-03-04 15:26:41,610 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 307 transitions, 3017 flow [2025-03-04 15:26:41,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 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:26:41,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:41,610 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:41,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 15:26:41,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 15:26:41,811 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:41,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:41,811 INFO L85 PathProgramCache]: Analyzing trace with hash 30576251, now seen corresponding path program 1 times [2025-03-04 15:26:41,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:41,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263801542] [2025-03-04 15:26:41,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:41,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:41,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:26:41,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:26:41,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:41,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:26:41,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:41,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263801542] [2025-03-04 15:26:41,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263801542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:41,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386001914] [2025-03-04 15:26:41,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:41,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:41,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:41,885 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:41,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 15:26:41,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:26:41,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:26:41,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:41,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:41,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:41,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:26:42,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 15:26:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386001914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:42,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:42,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:26:42,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436864290] [2025-03-04 15:26:42,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:42,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:26:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:42,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:26:42,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:26:42,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 81 [2025-03-04 15:26:42,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 307 transitions, 3017 flow. Second operand has 12 states, 12 states have (on average 43.583333333333336) internal successors, (523), 12 states have internal predecessors, (523), 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:26:42,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:42,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 81 [2025-03-04 15:26:42,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:44,024 INFO L124 PetriNetUnfolderBase]: 7867/17255 cut-off events. [2025-03-04 15:26:44,024 INFO L125 PetriNetUnfolderBase]: For 38086/38234 co-relation queries the response was YES. [2025-03-04 15:26:44,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60766 conditions, 17255 events. 7867/17255 cut-off events. For 38086/38234 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 142880 event pairs, 1476 based on Foata normal form. 258/17494 useless extension candidates. Maximal degree in co-relation 59366. Up to 4732 conditions per place. [2025-03-04 15:26:44,133 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 501 selfloop transitions, 28 changer transitions 0/559 dead transitions. [2025-03-04 15:26:44,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 559 transitions, 5626 flow [2025-03-04 15:26:44,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:26:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:26:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 533 transitions. [2025-03-04 15:26:44,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6580246913580247 [2025-03-04 15:26:44,135 INFO L175 Difference]: Start difference. First operand has 191 places, 307 transitions, 3017 flow. Second operand 10 states and 533 transitions. [2025-03-04 15:26:44,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 559 transitions, 5626 flow [2025-03-04 15:26:44,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 559 transitions, 5456 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:44,308 INFO L231 Difference]: Finished difference. Result has 200 places, 322 transitions, 3087 flow [2025-03-04 15:26:44,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2847, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3087, PETRI_PLACES=200, PETRI_TRANSITIONS=322} [2025-03-04 15:26:44,308 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 123 predicate places. [2025-03-04 15:26:44,308 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 322 transitions, 3087 flow [2025-03-04 15:26:44,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 43.583333333333336) internal successors, (523), 12 states have internal predecessors, (523), 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:26:44,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:44,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:44,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:44,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:44,509 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:44,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:44,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1665646115, now seen corresponding path program 1 times [2025-03-04 15:26:44,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:44,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650955211] [2025-03-04 15:26:44,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:44,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:44,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:26:44,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:26:44,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:44,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:44,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:44,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650955211] [2025-03-04 15:26:44,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650955211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:44,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660236664] [2025-03-04 15:26:44,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:44,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:44,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:44,570 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:44,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 15:26:44,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:26:44,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:26:44,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:44,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:44,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:26:44,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:44,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:26:44,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660236664] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:44,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:26:44,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2025-03-04 15:26:44,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401463272] [2025-03-04 15:26:44,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:44,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:44,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:44,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:44,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:26:44,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 81 [2025-03-04 15:26:44,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 322 transitions, 3087 flow. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 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:26:44,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:44,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 81 [2025-03-04 15:26:44,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:46,553 INFO L124 PetriNetUnfolderBase]: 6595/16360 cut-off events. [2025-03-04 15:26:46,554 INFO L125 PetriNetUnfolderBase]: For 46832/46898 co-relation queries the response was YES. [2025-03-04 15:26:46,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57838 conditions, 16360 events. 6595/16360 cut-off events. For 46832/46898 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 136156 event pairs, 2820 based on Foata normal form. 301/16637 useless extension candidates. Maximal degree in co-relation 56464. Up to 4343 conditions per place. [2025-03-04 15:26:46,650 INFO L140 encePairwiseOnDemand]: 74/81 looper letters, 347 selfloop transitions, 22 changer transitions 1/404 dead transitions. [2025-03-04 15:26:46,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 404 transitions, 4362 flow [2025-03-04 15:26:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 288 transitions. [2025-03-04 15:26:46,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2025-03-04 15:26:46,651 INFO L175 Difference]: Start difference. First operand has 200 places, 322 transitions, 3087 flow. Second operand 5 states and 288 transitions. [2025-03-04 15:26:46,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 404 transitions, 4362 flow [2025-03-04 15:26:46,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 404 transitions, 4332 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:46,760 INFO L231 Difference]: Finished difference. Result has 206 places, 328 transitions, 3238 flow [2025-03-04 15:26:46,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3238, PETRI_PLACES=206, PETRI_TRANSITIONS=328} [2025-03-04 15:26:46,761 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 129 predicate places. [2025-03-04 15:26:46,761 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 328 transitions, 3238 flow [2025-03-04 15:26:46,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 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:26:46,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:46,761 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:46,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 15:26:46,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:46,962 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:46,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1192842247, now seen corresponding path program 1 times [2025-03-04 15:26:46,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:46,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55692135] [2025-03-04 15:26:46,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:46,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:46,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:26:46,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:26:46,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:46,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:26:47,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:47,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55692135] [2025-03-04 15:26:47,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55692135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:47,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172228321] [2025-03-04 15:26:47,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:47,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:47,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:47,039 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:47,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 15:26:47,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 15:26:47,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 15:26:47,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:47,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:47,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:26:47,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:47,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:26:47,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172228321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:47,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:47,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 15:26:47,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976889996] [2025-03-04 15:26:47,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:47,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:26:47,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:47,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:26:47,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:26:47,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 81 [2025-03-04 15:26:47,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 328 transitions, 3238 flow. Second operand has 19 states, 19 states have (on average 33.89473684210526) internal successors, (644), 19 states have internal predecessors, (644), 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:26:47,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:47,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 81 [2025-03-04 15:26:47,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:52,967 INFO L124 PetriNetUnfolderBase]: 19508/35860 cut-off events. [2025-03-04 15:26:52,967 INFO L125 PetriNetUnfolderBase]: For 97864/98248 co-relation queries the response was YES. [2025-03-04 15:26:53,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131726 conditions, 35860 events. 19508/35860 cut-off events. For 97864/98248 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 262417 event pairs, 6285 based on Foata normal form. 516/36335 useless extension candidates. Maximal degree in co-relation 130162. Up to 9637 conditions per place. [2025-03-04 15:26:53,258 INFO L140 encePairwiseOnDemand]: 64/81 looper letters, 551 selfloop transitions, 187 changer transitions 0/760 dead transitions. [2025-03-04 15:26:53,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 760 transitions, 7740 flow [2025-03-04 15:26:53,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 15:26:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 15:26:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 788 transitions. [2025-03-04 15:26:53,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48641975308641977 [2025-03-04 15:26:53,260 INFO L175 Difference]: Start difference. First operand has 206 places, 328 transitions, 3238 flow. Second operand 20 states and 788 transitions. [2025-03-04 15:26:53,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 760 transitions, 7740 flow [2025-03-04 15:26:53,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 760 transitions, 7727 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:53,591 INFO L231 Difference]: Finished difference. Result has 230 places, 407 transitions, 4762 flow [2025-03-04 15:26:53,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=3231, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4762, PETRI_PLACES=230, PETRI_TRANSITIONS=407} [2025-03-04 15:26:53,591 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 153 predicate places. [2025-03-04 15:26:53,592 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 407 transitions, 4762 flow [2025-03-04 15:26:53,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 33.89473684210526) internal successors, (644), 19 states have internal predecessors, (644), 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:26:53,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:53,592 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:53,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 15:26:53,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:53,792 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:26:53,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:53,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1784997725, now seen corresponding path program 2 times [2025-03-04 15:26:53,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:53,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487875071] [2025-03-04 15:26:53,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:53,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:53,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 15:26:53,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 37 statements. [2025-03-04 15:26:53,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:53,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 15:26:53,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:53,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487875071] [2025-03-04 15:26:53,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487875071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:53,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355990186] [2025-03-04 15:26:53,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:26:53,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:53,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:53,827 INFO L229 MonitoredProcess]: Starting monitored process 20 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:26:53,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 15:26:53,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 15:26:53,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 37 statements. [2025-03-04 15:26:53,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:26:53,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:53,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:26:53,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:54,779 WARN L873 $PredicateComparison]: unable to prove that (exists ((~M~0 Int) (~N~0 Int)) (let ((.cse0 (* ~N~0 ~M~0))) (and (<= .cse0 2147483647) (<= c_~L~0 .cse0)))) is different from true [2025-03-04 15:26:55,806 WARN L873 $PredicateComparison]: unable to prove that (exists ((~M~0 Int) (~N~0 Int)) (let ((.cse0 (* ~N~0 ~M~0))) (and (<= .cse0 2147483647) (<= (+ |c_thread1Thread1of1ForFork1_#t~post2| 1) .cse0)))) is different from true [2025-03-04 15:26:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 8 not checked. [2025-03-04 15:26:55,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:26:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 15:26:55,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355990186] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:26:55,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:26:55,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 15:26:55,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699196963] [2025-03-04 15:26:55,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:26:55,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:26:55,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:55,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:26:55,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=9, Unknown=2, NotChecked=10, Total=30 [2025-03-04 15:26:55,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 81 [2025-03-04 15:26:55,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 407 transitions, 4762 flow. Second operand has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 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:26:55,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:55,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 81 [2025-03-04 15:26:55,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:02,457 INFO L124 PetriNetUnfolderBase]: 14249/29639 cut-off events. [2025-03-04 15:27:02,458 INFO L125 PetriNetUnfolderBase]: For 131726/131762 co-relation queries the response was YES. [2025-03-04 15:27:02,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119274 conditions, 29639 events. 14249/29639 cut-off events. For 131726/131762 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 238541 event pairs, 5360 based on Foata normal form. 298/29607 useless extension candidates. Maximal degree in co-relation 117442. Up to 13953 conditions per place. [2025-03-04 15:27:02,706 INFO L140 encePairwiseOnDemand]: 73/81 looper letters, 390 selfloop transitions, 17 changer transitions 38/481 dead transitions. [2025-03-04 15:27:02,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 481 transitions, 6384 flow [2025-03-04 15:27:02,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:27:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:27:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 311 transitions. [2025-03-04 15:27:02,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6399176954732511 [2025-03-04 15:27:02,708 INFO L175 Difference]: Start difference. First operand has 230 places, 407 transitions, 4762 flow. Second operand 6 states and 311 transitions. [2025-03-04 15:27:02,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 481 transitions, 6384 flow [2025-03-04 15:27:03,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 481 transitions, 6210 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-03-04 15:27:03,031 INFO L231 Difference]: Finished difference. Result has 227 places, 392 transitions, 4500 flow [2025-03-04 15:27:03,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=4628, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4500, PETRI_PLACES=227, PETRI_TRANSITIONS=392} [2025-03-04 15:27:03,032 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 150 predicate places. [2025-03-04 15:27:03,032 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 392 transitions, 4500 flow [2025-03-04 15:27:03,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:03,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:03,032 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:03,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 15:27:03,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:03,233 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:27:03,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:03,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1170774697, now seen corresponding path program 1 times [2025-03-04 15:27:03,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:03,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383792273] [2025-03-04 15:27:03,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:03,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:03,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:27:03,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:27:03,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:03,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:27:03,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1877868867] [2025-03-04 15:27:03,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:03,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:03,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:03,254 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:03,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 15:27:03,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:27:03,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:27:03,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:03,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:03,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:27:03,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:27:03,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:27:12,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:12,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383792273] [2025-03-04 15:27:12,424 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 15:27:12,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877868867] [2025-03-04 15:27:12,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877868867] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:12,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:27:12,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 15:27:12,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192763519] [2025-03-04 15:27:12,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:12,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:27:12,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:12,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:27:12,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=44, Unknown=3, NotChecked=0, Total=72 [2025-03-04 15:27:15,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 15:27:18,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 15:27:22,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 15:27:26,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 15:27:30,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-04 15:27:30,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 81 [2025-03-04 15:27:30,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 392 transitions, 4500 flow. Second operand has 9 states, 9 states have (on average 39.666666666666664) internal successors, (357), 9 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:30,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:30,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 81 [2025-03-04 15:27:30,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:43,455 INFO L124 PetriNetUnfolderBase]: 22028/37894 cut-off events. [2025-03-04 15:27:43,455 INFO L125 PetriNetUnfolderBase]: For 124275/124275 co-relation queries the response was YES. [2025-03-04 15:27:43,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151561 conditions, 37894 events. 22028/37894 cut-off events. For 124275/124275 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 257164 event pairs, 12156 based on Foata normal form. 258/38115 useless extension candidates. Maximal degree in co-relation 151008. Up to 26939 conditions per place. [2025-03-04 15:27:43,757 INFO L140 encePairwiseOnDemand]: 71/81 looper letters, 580 selfloop transitions, 23 changer transitions 0/623 dead transitions. [2025-03-04 15:27:43,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 623 transitions, 7210 flow [2025-03-04 15:27:43,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:27:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:27:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 476 transitions. [2025-03-04 15:27:43,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5876543209876544 [2025-03-04 15:27:43,758 INFO L175 Difference]: Start difference. First operand has 227 places, 392 transitions, 4500 flow. Second operand 10 states and 476 transitions. [2025-03-04 15:27:43,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 623 transitions, 7210 flow [2025-03-04 15:27:44,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 623 transitions, 6911 flow, removed 28 selfloop flow, removed 9 redundant places. [2025-03-04 15:27:44,103 INFO L231 Difference]: Finished difference. Result has 230 places, 404 transitions, 4626 flow [2025-03-04 15:27:44,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=4409, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4626, PETRI_PLACES=230, PETRI_TRANSITIONS=404} [2025-03-04 15:27:44,103 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 153 predicate places. [2025-03-04 15:27:44,103 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 404 transitions, 4626 flow [2025-03-04 15:27:44,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.666666666666664) internal successors, (357), 9 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:44,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:44,104 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:44,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 15:27:44,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-04 15:27:44,304 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:27:44,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:44,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1934276513, now seen corresponding path program 1 times [2025-03-04 15:27:44,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:44,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733132615] [2025-03-04 15:27:44,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:44,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:44,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:27:44,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:27:44,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:44,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:27:44,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:44,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733132615] [2025-03-04 15:27:44,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733132615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:44,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854154021] [2025-03-04 15:27:44,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:44,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:44,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:44,381 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:44,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 15:27:44,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:27:44,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:27:44,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:44,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:44,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:27:44,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 15:27:44,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:27:44,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854154021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:44,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:27:44,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:27:44,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268512981] [2025-03-04 15:27:44,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:44,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:27:44,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:44,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:27:44,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:27:44,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 81 [2025-03-04 15:27:44,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 404 transitions, 4626 flow. Second operand has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 6 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:44,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:44,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 81 [2025-03-04 15:27:44,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:48,397 INFO L124 PetriNetUnfolderBase]: 11678/26949 cut-off events. [2025-03-04 15:27:48,397 INFO L125 PetriNetUnfolderBase]: For 97391/97412 co-relation queries the response was YES. [2025-03-04 15:27:48,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104732 conditions, 26949 events. 11678/26949 cut-off events. For 97391/97412 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 230361 event pairs, 2808 based on Foata normal form. 516/27120 useless extension candidates. Maximal degree in co-relation 104180. Up to 8313 conditions per place. [2025-03-04 15:27:48,603 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 423 selfloop transitions, 42 changer transitions 0/501 dead transitions. [2025-03-04 15:27:48,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 501 transitions, 6092 flow [2025-03-04 15:27:48,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:27:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:27:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 323 transitions. [2025-03-04 15:27:48,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6646090534979424 [2025-03-04 15:27:48,608 INFO L175 Difference]: Start difference. First operand has 230 places, 404 transitions, 4626 flow. Second operand 6 states and 323 transitions. [2025-03-04 15:27:48,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 501 transitions, 6092 flow [2025-03-04 15:27:48,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 501 transitions, 6078 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:48,936 INFO L231 Difference]: Finished difference. Result has 231 places, 401 transitions, 4676 flow [2025-03-04 15:27:48,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=4592, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4676, PETRI_PLACES=231, PETRI_TRANSITIONS=401} [2025-03-04 15:27:48,937 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 154 predicate places. [2025-03-04 15:27:48,937 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 401 transitions, 4676 flow [2025-03-04 15:27:48,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.833333333333336) internal successors, (281), 6 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:48,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:48,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:48,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 15:27:49,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-04 15:27:49,138 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-04 15:27:49,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:49,139 INFO L85 PathProgramCache]: Analyzing trace with hash 268195439, now seen corresponding path program 1 times [2025-03-04 15:27:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:49,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969469614] [2025-03-04 15:27:49,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:49,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:49,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 15:27:49,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:27:49,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:49,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:27:49,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796583838] [2025-03-04 15:27:49,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:49,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:49,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:49,162 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:27:49,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 15:27:49,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 15:27:49,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:27:49,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:49,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:49,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:27:49,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:27:49,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:27:49,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:49,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969469614] [2025-03-04 15:27:49,319 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 15:27:49,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796583838] [2025-03-04 15:27:49,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796583838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:49,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:49,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:49,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28905119] [2025-03-04 15:27:49,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:49,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:49,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:49,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:49,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:49,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 81 [2025-03-04 15:27:49,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 401 transitions, 4676 flow. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:49,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:49,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 81 [2025-03-04 15:27:49,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand