./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.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 1d936eafcc314e66bb4cd572754c58bf1f2fc59d35c83764f43dae769bce220a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:28:45,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:28:45,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:28:45,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:28:45,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:28:45,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:28:45,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:28:45,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:28:45,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:28:45,684 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:28:45,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:28:45,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:28:45,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:28:45,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:28:45,686 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:28:45,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:28:45,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:28:45,686 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:28:45,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:28:45,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:28:45,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:28:45,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:28:45,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:28:45,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:28:45,687 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:28:45,687 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:28:45,687 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:28:45,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:28:45,687 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:28:45,687 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:28:45,687 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:28:45,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:28:45,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:28:45,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:28:45,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:28:45,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:28:45,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:28:45,688 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:28:45,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:28:45,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:28:45,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:28:45,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:28:45,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:28:45,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:28:45,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:28:45,689 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 -> 1d936eafcc314e66bb4cd572754c58bf1f2fc59d35c83764f43dae769bce220a [2025-03-04 15:28:45,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:28:45,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:28:45,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:28:45,900 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:28:45,900 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:28:45,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2025-03-04 15:28:47,042 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972b259e7/0dc9f517217744dfbff2ee021afce408/FLAGa977a3508 [2025-03-04 15:28:47,270 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:28:47,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2025-03-04 15:28:47,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972b259e7/0dc9f517217744dfbff2ee021afce408/FLAGa977a3508 [2025-03-04 15:28:47,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972b259e7/0dc9f517217744dfbff2ee021afce408 [2025-03-04 15:28:47,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:28:47,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:28:47,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:28:47,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:28:47,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:28:47,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:28:47" (1/1) ... [2025-03-04 15:28:47,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e39e824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:47, skipping insertion in model container [2025-03-04 15:28:47,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:28:47" (1/1) ... [2025-03-04 15:28:47,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:28:47,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:28:47,771 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:28:47,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:28:47,808 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:28:47,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:47 WrapperNode [2025-03-04 15:28:47,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:28:47,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:28:47,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:28:47,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:28:47,814 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:28:47" (1/1) ... [2025-03-04 15:28:47,820 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:28:47" (1/1) ... [2025-03-04 15:28:47,844 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 222 [2025-03-04 15:28:47,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:28:47,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:28:47,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:28:47,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:28:47,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:47" (1/1) ... [2025-03-04 15:28:47,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:47" (1/1) ... [2025-03-04 15:28:47,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:47" (1/1) ... [2025-03-04 15:28:47,874 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 15:28:47,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:47" (1/1) ... [2025-03-04 15:28:47,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:47" (1/1) ... [2025-03-04 15:28:47,882 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:47" (1/1) ... [2025-03-04 15:28:47,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:47" (1/1) ... [2025-03-04 15:28:47,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:47" (1/1) ... [2025-03-04 15:28:47,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:47" (1/1) ... [2025-03-04 15:28:47,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:28:47,887 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:28:47,887 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:28:47,887 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:28:47,888 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:47" (1/1) ... [2025-03-04 15:28:47,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:28:47,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:47,914 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:28:47,919 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:28:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:28:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:28:47,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:28:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:28:47,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:28:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:28:47,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:28:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:28:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:28:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:28:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:28:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:28:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:28:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:28:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:28:47,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:28:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:28:47,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:28:47,934 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:28:48,018 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:28:48,020 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:28:48,368 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:28:48,369 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:28:48,708 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:28:48,708 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:28:48,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:28:48 BoogieIcfgContainer [2025-03-04 15:28:48,709 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:28:48,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:28:48,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:28:48,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:28:48,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:28:47" (1/3) ... [2025-03-04 15:28:48,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499e8a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:28:48, skipping insertion in model container [2025-03-04 15:28:48,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:28:47" (2/3) ... [2025-03-04 15:28:48,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499e8a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:28:48, skipping insertion in model container [2025-03-04 15:28:48,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:28:48" (3/3) ... [2025-03-04 15:28:48,715 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2025-03-04 15:28:48,726 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:28:48,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt2.wvr.c that has 4 procedures, 62 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-03-04 15:28:48,727 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:28:48,826 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:28:48,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 65 transitions, 151 flow [2025-03-04 15:28:48,878 INFO L124 PetriNetUnfolderBase]: 4/62 cut-off events. [2025-03-04 15:28:48,883 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:28:48,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 4/62 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 217 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2025-03-04 15:28:48,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 65 transitions, 151 flow [2025-03-04 15:28:48,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 60 transitions, 135 flow [2025-03-04 15:28:48,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:28:48,916 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;@6efef103, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:28:48,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-03-04 15:28:48,919 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:28:48,919 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:28:48,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:28:48,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:48,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:28:48,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:48,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash 696622, now seen corresponding path program 1 times [2025-03-04 15:28:48,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:48,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995674726] [2025-03-04 15:28:48,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:48,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:48,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:28:49,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:28:49,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:49,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:49,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:28:49,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:49,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995674726] [2025-03-04 15:28:49,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995674726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:49,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:49,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:28:49,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839555054] [2025-03-04 15:28:49,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:49,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:49,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:49,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:49,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:49,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2025-03-04 15:28:49,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:49,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:49,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2025-03-04 15:28:49,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:49,859 INFO L124 PetriNetUnfolderBase]: 2971/4905 cut-off events. [2025-03-04 15:28:49,860 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-03-04 15:28:49,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9346 conditions, 4905 events. 2971/4905 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 34373 event pairs, 2534 based on Foata normal form. 1/2990 useless extension candidates. Maximal degree in co-relation 8829. Up to 4217 conditions per place. [2025-03-04 15:28:49,891 INFO L140 encePairwiseOnDemand]: 53/65 looper letters, 37 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-03-04 15:28:49,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 211 flow [2025-03-04 15:28:49,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2025-03-04 15:28:49,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2025-03-04 15:28:49,901 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 135 flow. Second operand 4 states and 125 transitions. [2025-03-04 15:28:49,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 211 flow [2025-03-04 15:28:49,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 202 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:28:49,908 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 143 flow [2025-03-04 15:28:49,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2025-03-04 15:28:49,913 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2025-03-04 15:28:49,913 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 143 flow [2025-03-04 15:28:49,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:49,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:49,915 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:28:49,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:28:49,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:49,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash -721154580, now seen corresponding path program 1 times [2025-03-04 15:28:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:49,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643587804] [2025-03-04 15:28:49,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:49,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:28:49,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:28:49,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:49,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:50,050 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:28:50,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:50,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643587804] [2025-03-04 15:28:50,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643587804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:50,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638376746] [2025-03-04 15:28:50,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:50,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:50,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:50,053 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:28:50,054 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:28:50,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:28:50,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:28:50,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:50,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:50,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:28:50,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:50,186 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:28:50,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:28:50,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638376746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:50,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:28:50,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:28:50,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627565651] [2025-03-04 15:28:50,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:50,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:28:50,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:50,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:28:50,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:28:50,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2025-03-04 15:28:50,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:50,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:50,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2025-03-04 15:28:50,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:50,801 INFO L124 PetriNetUnfolderBase]: 2971/4904 cut-off events. [2025-03-04 15:28:50,801 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-04 15:28:50,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9274 conditions, 4904 events. 2971/4904 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 34403 event pairs, 2534 based on Foata normal form. 1/2990 useless extension candidates. Maximal degree in co-relation 9247. Up to 4212 conditions per place. [2025-03-04 15:28:50,826 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 33 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2025-03-04 15:28:50,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 219 flow [2025-03-04 15:28:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:28:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:28:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2025-03-04 15:28:50,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2025-03-04 15:28:50,828 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 143 flow. Second operand 6 states and 155 transitions. [2025-03-04 15:28:50,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 219 flow [2025-03-04 15:28:50,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 56 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:28:50,830 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 150 flow [2025-03-04 15:28:50,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2025-03-04 15:28:50,830 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2025-03-04 15:28:50,830 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 150 flow [2025-03-04 15:28:50,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:50,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:50,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:28:50,838 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:28:51,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:51,034 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:51,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash -718716887, now seen corresponding path program 1 times [2025-03-04 15:28:51,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:51,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791312369] [2025-03-04 15:28:51,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:51,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:28:51,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:28:51,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:51,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:51,148 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:28:51,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:51,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791312369] [2025-03-04 15:28:51,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791312369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:51,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:51,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:28:51,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872136927] [2025-03-04 15:28:51,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:51,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:28:51,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:51,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:28:51,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:28:51,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 65 [2025-03-04 15:28:51,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:51,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:51,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 65 [2025-03-04 15:28:51,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:51,860 INFO L124 PetriNetUnfolderBase]: 4377/7257 cut-off events. [2025-03-04 15:28:51,861 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-04 15:28:51,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13763 conditions, 7257 events. 4377/7257 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 52156 event pairs, 3263 based on Foata normal form. 0/4517 useless extension candidates. Maximal degree in co-relation 10358. Up to 4714 conditions per place. [2025-03-04 15:28:51,898 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 82 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2025-03-04 15:28:51,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 103 transitions, 427 flow [2025-03-04 15:28:51,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2025-03-04 15:28:51,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5784615384615385 [2025-03-04 15:28:51,900 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 150 flow. Second operand 5 states and 188 transitions. [2025-03-04 15:28:51,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 103 transitions, 427 flow [2025-03-04 15:28:51,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 405 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 15:28:51,902 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 153 flow [2025-03-04 15:28:51,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2025-03-04 15:28:51,903 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-03-04 15:28:51,903 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 153 flow [2025-03-04 15:28:51,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:51,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:51,903 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:28:51,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:28:51,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:51,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash -880954881, now seen corresponding path program 1 times [2025-03-04 15:28:51,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:51,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238019066] [2025-03-04 15:28:51,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:51,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:51,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:28:51,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:28:51,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:51,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:51,979 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:28:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238019066] [2025-03-04 15:28:51,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238019066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008322978] [2025-03-04 15:28:51,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:51,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:51,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:51,981 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:28:51,983 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:28:52,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:28:52,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:28:52,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:52,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:52,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:28:52,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:52,077 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:28:52,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:52,117 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:28:52,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008322978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:52,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:52,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:28:52,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29835375] [2025-03-04 15:28:52,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:52,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:28:52,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:52,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:28:52,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:28:52,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2025-03-04 15:28:52,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 153 flow. Second operand has 12 states, 12 states have (on average 20.083333333333332) internal successors, (241), 12 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:28:52,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:52,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2025-03-04 15:28:52,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:52,719 INFO L124 PetriNetUnfolderBase]: 4026/6744 cut-off events. [2025-03-04 15:28:52,719 INFO L125 PetriNetUnfolderBase]: For 1219/1323 co-relation queries the response was YES. [2025-03-04 15:28:52,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13644 conditions, 6744 events. 4026/6744 cut-off events. For 1219/1323 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 49241 event pairs, 3468 based on Foata normal form. 3/4225 useless extension candidates. Maximal degree in co-relation 9607. Up to 5782 conditions per place. [2025-03-04 15:28:52,743 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 38 selfloop transitions, 13 changer transitions 0/67 dead transitions. [2025-03-04 15:28:52,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 285 flow [2025-03-04 15:28:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:28:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:28:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2025-03-04 15:28:52,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3723076923076923 [2025-03-04 15:28:52,744 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 153 flow. Second operand 10 states and 242 transitions. [2025-03-04 15:28:52,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 285 flow [2025-03-04 15:28:52,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 67 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:52,746 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 222 flow [2025-03-04 15:28:52,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=222, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2025-03-04 15:28:52,747 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 8 predicate places. [2025-03-04 15:28:52,747 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 222 flow [2025-03-04 15:28:52,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.083333333333332) internal successors, (241), 12 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:28:52,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:52,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:52,753 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:28:52,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 15:28:52,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:52,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash 751657040, now seen corresponding path program 1 times [2025-03-04 15:28:52,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:52,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996586983] [2025-03-04 15:28:52,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:52,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:52,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:28:52,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:28:52,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:52,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:53,061 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:28:53,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:53,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996586983] [2025-03-04 15:28:53,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996586983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:53,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:53,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:28:53,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053904257] [2025-03-04 15:28:53,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:53,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:28:53,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:53,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:28:53,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:28:53,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 65 [2025-03-04 15:28:53,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:53,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:53,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 65 [2025-03-04 15:28:53,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:53,539 INFO L124 PetriNetUnfolderBase]: 3682/6177 cut-off events. [2025-03-04 15:28:53,539 INFO L125 PetriNetUnfolderBase]: For 775/937 co-relation queries the response was YES. [2025-03-04 15:28:53,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12234 conditions, 6177 events. 3682/6177 cut-off events. For 775/937 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 43149 event pairs, 3023 based on Foata normal form. 0/3827 useless extension candidates. Maximal degree in co-relation 12198. Up to 4743 conditions per place. [2025-03-04 15:28:53,560 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 76 selfloop transitions, 5 changer transitions 2/99 dead transitions. [2025-03-04 15:28:53,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 469 flow [2025-03-04 15:28:53,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2025-03-04 15:28:53,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-03-04 15:28:53,562 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 222 flow. Second operand 5 states and 175 transitions. [2025-03-04 15:28:53,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 99 transitions, 469 flow [2025-03-04 15:28:53,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 99 transitions, 458 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:53,564 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 236 flow [2025-03-04 15:28:53,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2025-03-04 15:28:53,565 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2025-03-04 15:28:53,565 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 236 flow [2025-03-04 15:28:53,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:53,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:53,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:53,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:28:53,565 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:53,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:53,566 INFO L85 PathProgramCache]: Analyzing trace with hash -486624595, now seen corresponding path program 1 times [2025-03-04 15:28:53,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:53,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198819073] [2025-03-04 15:28:53,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:53,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:53,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:28:53,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:28:53,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:53,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:53,650 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:28:53,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:53,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198819073] [2025-03-04 15:28:53,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198819073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:53,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:53,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:28:53,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713657488] [2025-03-04 15:28:53,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:53,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:28:53,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:53,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:28:53,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:28:53,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 65 [2025-03-04 15:28:53,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:53,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:53,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 65 [2025-03-04 15:28:53,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:54,381 INFO L124 PetriNetUnfolderBase]: 5012/8490 cut-off events. [2025-03-04 15:28:54,381 INFO L125 PetriNetUnfolderBase]: For 1451/1716 co-relation queries the response was YES. [2025-03-04 15:28:54,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17501 conditions, 8490 events. 5012/8490 cut-off events. For 1451/1716 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 64387 event pairs, 2213 based on Foata normal form. 0/5264 useless extension candidates. Maximal degree in co-relation 17463. Up to 3766 conditions per place. [2025-03-04 15:28:54,419 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 77 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2025-03-04 15:28:54,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 97 transitions, 463 flow [2025-03-04 15:28:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:28:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:28:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-03-04 15:28:54,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6564102564102564 [2025-03-04 15:28:54,421 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 236 flow. Second operand 3 states and 128 transitions. [2025-03-04 15:28:54,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 97 transitions, 463 flow [2025-03-04 15:28:54,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 97 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:54,427 INFO L231 Difference]: Finished difference. Result has 80 places, 71 transitions, 253 flow [2025-03-04 15:28:54,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=80, PETRI_TRANSITIONS=71} [2025-03-04 15:28:54,428 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 14 predicate places. [2025-03-04 15:28:54,429 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 253 flow [2025-03-04 15:28:54,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:54,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:54,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:54,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:28:54,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:54,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash -486624594, now seen corresponding path program 1 times [2025-03-04 15:28:54,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:54,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642163703] [2025-03-04 15:28:54,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:54,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:28:54,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:28:54,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:54,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:54,513 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:28:54,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:54,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642163703] [2025-03-04 15:28:54,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642163703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:54,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:54,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:28:54,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641785922] [2025-03-04 15:28:54,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:54,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:28:54,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:54,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:28:54,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:28:54,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 65 [2025-03-04 15:28:54,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:54,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:54,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 65 [2025-03-04 15:28:54,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:55,047 INFO L124 PetriNetUnfolderBase]: 4866/8395 cut-off events. [2025-03-04 15:28:55,048 INFO L125 PetriNetUnfolderBase]: For 2598/2861 co-relation queries the response was YES. [2025-03-04 15:28:55,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18150 conditions, 8395 events. 4866/8395 cut-off events. For 2598/2861 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 63921 event pairs, 2213 based on Foata normal form. 144/5919 useless extension candidates. Maximal degree in co-relation 18111. Up to 3620 conditions per place. [2025-03-04 15:28:55,085 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 76 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-03-04 15:28:55,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 96 transitions, 470 flow [2025-03-04 15:28:55,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:28:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:28:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-03-04 15:28:55,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6512820512820513 [2025-03-04 15:28:55,087 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 253 flow. Second operand 3 states and 127 transitions. [2025-03-04 15:28:55,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 96 transitions, 470 flow [2025-03-04 15:28:55,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 96 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:55,092 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 249 flow [2025-03-04 15:28:55,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2025-03-04 15:28:55,093 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 14 predicate places. [2025-03-04 15:28:55,093 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 249 flow [2025-03-04 15:28:55,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:55,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:55,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:55,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:28:55,094 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:55,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:55,094 INFO L85 PathProgramCache]: Analyzing trace with hash -486624598, now seen corresponding path program 1 times [2025-03-04 15:28:55,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:55,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051213494] [2025-03-04 15:28:55,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:55,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:55,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:28:55,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:28:55,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:55,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:55,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:55,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051213494] [2025-03-04 15:28:55,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051213494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:55,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308851512] [2025-03-04 15:28:55,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:55,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:55,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:55,250 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:55,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:28:55,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:28:55,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:28:55,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:55,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:55,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:28:55,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:55,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:28:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:55,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:55,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-04 15:28:55,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-04 15:28:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:55,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308851512] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:55,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:55,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:28:55,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454468467] [2025-03-04 15:28:55,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:55,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:28:55,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:55,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:28:55,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:28:55,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 65 [2025-03-04 15:28:55,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 249 flow. Second operand has 11 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:55,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:55,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 65 [2025-03-04 15:28:55,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:56,187 INFO L124 PetriNetUnfolderBase]: 4866/8745 cut-off events. [2025-03-04 15:28:56,187 INFO L125 PetriNetUnfolderBase]: For 2552/2914 co-relation queries the response was YES. [2025-03-04 15:28:56,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18396 conditions, 8745 events. 4866/8745 cut-off events. For 2552/2914 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 70582 event pairs, 2012 based on Foata normal form. 0/6109 useless extension candidates. Maximal degree in co-relation 18357. Up to 2921 conditions per place. [2025-03-04 15:28:56,217 INFO L140 encePairwiseOnDemand]: 53/65 looper letters, 97 selfloop transitions, 16 changer transitions 1/131 dead transitions. [2025-03-04 15:28:56,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 131 transitions, 621 flow [2025-03-04 15:28:56,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:28:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:28:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 274 transitions. [2025-03-04 15:28:56,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5269230769230769 [2025-03-04 15:28:56,221 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 249 flow. Second operand 8 states and 274 transitions. [2025-03-04 15:28:56,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 131 transitions, 621 flow [2025-03-04 15:28:56,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 621 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:28:56,229 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 310 flow [2025-03-04 15:28:56,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=310, PETRI_PLACES=89, PETRI_TRANSITIONS=73} [2025-03-04 15:28:56,230 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 23 predicate places. [2025-03-04 15:28:56,230 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 310 flow [2025-03-04 15:28:56,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:56,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:56,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:56,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:28:56,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:56,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:56,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash -486624597, now seen corresponding path program 1 times [2025-03-04 15:28:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:56,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30256800] [2025-03-04 15:28:56,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:56,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:56,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:28:56,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:28:56,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:56,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:56,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30256800] [2025-03-04 15:28:56,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30256800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:28:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370980439] [2025-03-04 15:28:56,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:56,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:56,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:28:56,601 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:28:56,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:28:56,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:28:56,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:28:56,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:56,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:56,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 15:28:56,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:28:56,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:28:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:56,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:28:56,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 15:28:56,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:28:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:28:56,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370980439] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:28:56,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:28:56,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 15:28:56,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647304368] [2025-03-04 15:28:56,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:28:56,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:28:56,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:56,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:28:56,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:28:56,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 65 [2025-03-04 15:28:56,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 73 transitions, 310 flow. Second operand has 13 states, 13 states have (on average 22.53846153846154) internal successors, (293), 13 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:56,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:56,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 65 [2025-03-04 15:28:56,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:57,468 INFO L124 PetriNetUnfolderBase]: 4512/7712 cut-off events. [2025-03-04 15:28:57,468 INFO L125 PetriNetUnfolderBase]: For 6576/6949 co-relation queries the response was YES. [2025-03-04 15:28:57,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19274 conditions, 7712 events. 4512/7712 cut-off events. For 6576/6949 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 56971 event pairs, 1382 based on Foata normal form. 146/5622 useless extension candidates. Maximal degree in co-relation 19231. Up to 2921 conditions per place. [2025-03-04 15:28:57,496 INFO L140 encePairwiseOnDemand]: 53/65 looper letters, 96 selfloop transitions, 16 changer transitions 1/130 dead transitions. [2025-03-04 15:28:57,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 130 transitions, 668 flow [2025-03-04 15:28:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:28:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:28:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 273 transitions. [2025-03-04 15:28:57,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-03-04 15:28:57,498 INFO L175 Difference]: Start difference. First operand has 89 places, 73 transitions, 310 flow. Second operand 8 states and 273 transitions. [2025-03-04 15:28:57,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 130 transitions, 668 flow [2025-03-04 15:28:57,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 130 transitions, 639 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-04 15:28:57,502 INFO L231 Difference]: Finished difference. Result has 90 places, 72 transitions, 309 flow [2025-03-04 15:28:57,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=309, PETRI_PLACES=90, PETRI_TRANSITIONS=72} [2025-03-04 15:28:57,503 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 24 predicate places. [2025-03-04 15:28:57,503 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 72 transitions, 309 flow [2025-03-04 15:28:57,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 22.53846153846154) internal successors, (293), 13 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:57,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:57,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:57,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:28:57,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:28:57,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:57,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:57,704 INFO L85 PathProgramCache]: Analyzing trace with hash 769498405, now seen corresponding path program 1 times [2025-03-04 15:28:57,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:57,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611751700] [2025-03-04 15:28:57,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:57,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:57,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:28:57,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:28:57,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:57,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:57,775 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:28:57,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:57,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611751700] [2025-03-04 15:28:57,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611751700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:57,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:57,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:28:57,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216078962] [2025-03-04 15:28:57,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:57,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:28:57,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:57,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:28:57,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:28:57,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 65 [2025-03-04 15:28:57,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 72 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:57,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:57,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 65 [2025-03-04 15:28:57,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:58,466 INFO L124 PetriNetUnfolderBase]: 4769/7635 cut-off events. [2025-03-04 15:28:58,466 INFO L125 PetriNetUnfolderBase]: For 8585/9113 co-relation queries the response was YES. [2025-03-04 15:28:58,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19938 conditions, 7635 events. 4769/7635 cut-off events. For 8585/9113 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 52502 event pairs, 4132 based on Foata normal form. 0/5283 useless extension candidates. Maximal degree in co-relation 19896. Up to 6599 conditions per place. [2025-03-04 15:28:58,498 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 49 selfloop transitions, 2 changer transitions 22/89 dead transitions. [2025-03-04 15:28:58,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 89 transitions, 511 flow [2025-03-04 15:28:58,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:28:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:28:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-03-04 15:28:58,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49846153846153846 [2025-03-04 15:28:58,499 INFO L175 Difference]: Start difference. First operand has 90 places, 72 transitions, 309 flow. Second operand 5 states and 162 transitions. [2025-03-04 15:28:58,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 89 transitions, 511 flow [2025-03-04 15:28:58,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 89 transitions, 496 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:28:58,504 INFO L231 Difference]: Finished difference. Result has 91 places, 67 transitions, 276 flow [2025-03-04 15:28:58,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=91, PETRI_TRANSITIONS=67} [2025-03-04 15:28:58,505 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 25 predicate places. [2025-03-04 15:28:58,505 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 67 transitions, 276 flow [2025-03-04 15:28:58,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:58,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:58,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:58,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:28:58,505 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:58,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:58,506 INFO L85 PathProgramCache]: Analyzing trace with hash 505223313, now seen corresponding path program 1 times [2025-03-04 15:28:58,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:58,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528046326] [2025-03-04 15:28:58,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:58,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:58,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:28:58,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:28:58,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:58,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:58,547 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:28:58,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:58,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528046326] [2025-03-04 15:28:58,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528046326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:58,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:58,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:28:58,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601932516] [2025-03-04 15:28:58,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:58,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:28:58,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:58,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:28:58,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:28:58,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 65 [2025-03-04 15:28:58,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 67 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:58,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:58,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 65 [2025-03-04 15:28:58,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:59,143 INFO L124 PetriNetUnfolderBase]: 5587/8777 cut-off events. [2025-03-04 15:28:59,143 INFO L125 PetriNetUnfolderBase]: For 6514/7040 co-relation queries the response was YES. [2025-03-04 15:28:59,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22277 conditions, 8777 events. 5587/8777 cut-off events. For 6514/7040 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 61695 event pairs, 3933 based on Foata normal form. 292/6447 useless extension candidates. Maximal degree in co-relation 22247. Up to 6433 conditions per place. [2025-03-04 15:28:59,177 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 92 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2025-03-04 15:28:59,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 110 transitions, 576 flow [2025-03-04 15:28:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:28:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:28:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2025-03-04 15:28:59,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6115384615384616 [2025-03-04 15:28:59,178 INFO L175 Difference]: Start difference. First operand has 91 places, 67 transitions, 276 flow. Second operand 4 states and 159 transitions. [2025-03-04 15:28:59,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 110 transitions, 576 flow [2025-03-04 15:28:59,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 110 transitions, 538 flow, removed 17 selfloop flow, removed 7 redundant places. [2025-03-04 15:28:59,194 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 275 flow [2025-03-04 15:28:59,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2025-03-04 15:28:59,195 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2025-03-04 15:28:59,195 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 275 flow [2025-03-04 15:28:59,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:59,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:59,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:59,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:28:59,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:59,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:59,195 INFO L85 PathProgramCache]: Analyzing trace with hash 454048337, now seen corresponding path program 1 times [2025-03-04 15:28:59,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:59,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537360848] [2025-03-04 15:28:59,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:59,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:59,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:28:59,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:28:59,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:59,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:28:59,241 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:28:59,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:28:59,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537360848] [2025-03-04 15:28:59,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537360848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:28:59,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:28:59,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:28:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842667563] [2025-03-04 15:28:59,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:28:59,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:28:59,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:28:59,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:28:59,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:28:59,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 65 [2025-03-04 15:28:59,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:59,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:28:59,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 65 [2025-03-04 15:28:59,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:28:59,818 INFO L124 PetriNetUnfolderBase]: 5773/9650 cut-off events. [2025-03-04 15:28:59,818 INFO L125 PetriNetUnfolderBase]: For 9858/9858 co-relation queries the response was YES. [2025-03-04 15:28:59,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24249 conditions, 9650 events. 5773/9650 cut-off events. For 9858/9858 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 72147 event pairs, 1694 based on Foata normal form. 0/6932 useless extension candidates. Maximal degree in co-relation 24215. Up to 5988 conditions per place. [2025-03-04 15:28:59,853 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 73 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2025-03-04 15:28:59,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 94 transitions, 540 flow [2025-03-04 15:28:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:28:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:28:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-03-04 15:28:59,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2025-03-04 15:28:59,855 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 275 flow. Second operand 3 states and 126 transitions. [2025-03-04 15:28:59,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 94 transitions, 540 flow [2025-03-04 15:28:59,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 94 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:28:59,859 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 294 flow [2025-03-04 15:28:59,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2025-03-04 15:28:59,859 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 18 predicate places. [2025-03-04 15:28:59,860 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 294 flow [2025-03-04 15:28:59,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:28:59,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:28:59,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:28:59,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:28:59,860 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:28:59,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:28:59,860 INFO L85 PathProgramCache]: Analyzing trace with hash 454048334, now seen corresponding path program 1 times [2025-03-04 15:28:59,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:28:59,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088995850] [2025-03-04 15:28:59,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:28:59,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:28:59,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:28:59,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:28:59,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:28:59,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:00,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:00,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088995850] [2025-03-04 15:29:00,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088995850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:00,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596122910] [2025-03-04 15:29:00,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:00,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:00,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:00,038 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:29:00,040 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:29:00,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:29:00,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:29:00,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:00,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:00,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:29:00,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:00,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:29:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:00,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:00,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-04 15:29:00,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-04 15:29:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:00,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596122910] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:00,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:00,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:29:00,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256309079] [2025-03-04 15:29:00,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:00,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:29:00,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:00,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:29:00,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:29:00,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 65 [2025-03-04 15:29:00,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 294 flow. Second operand has 11 states, 11 states have (on average 22.818181818181817) internal successors, (251), 11 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:29:00,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:00,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 65 [2025-03-04 15:29:00,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:01,169 INFO L124 PetriNetUnfolderBase]: 7770/13075 cut-off events. [2025-03-04 15:29:01,169 INFO L125 PetriNetUnfolderBase]: For 11257/11257 co-relation queries the response was YES. [2025-03-04 15:29:01,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34053 conditions, 13075 events. 7770/13075 cut-off events. For 11257/11257 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 103181 event pairs, 2108 based on Foata normal form. 0/10331 useless extension candidates. Maximal degree in co-relation 34017. Up to 4112 conditions per place. [2025-03-04 15:29:01,291 INFO L140 encePairwiseOnDemand]: 53/65 looper letters, 90 selfloop transitions, 15 changer transitions 0/123 dead transitions. [2025-03-04 15:29:01,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 123 transitions, 739 flow [2025-03-04 15:29:01,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:29:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:29:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 253 transitions. [2025-03-04 15:29:01,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48653846153846153 [2025-03-04 15:29:01,293 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 294 flow. Second operand 8 states and 253 transitions. [2025-03-04 15:29:01,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 123 transitions, 739 flow [2025-03-04 15:29:01,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 123 transitions, 735 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:01,302 INFO L231 Difference]: Finished difference. Result has 92 places, 76 transitions, 366 flow [2025-03-04 15:29:01,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=366, PETRI_PLACES=92, PETRI_TRANSITIONS=76} [2025-03-04 15:29:01,302 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 26 predicate places. [2025-03-04 15:29:01,302 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 76 transitions, 366 flow [2025-03-04 15:29:01,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.818181818181817) internal successors, (251), 11 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:29:01,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:01,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:01,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:29:01,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 15:29:01,503 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:29:01,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:01,503 INFO L85 PathProgramCache]: Analyzing trace with hash 454048335, now seen corresponding path program 1 times [2025-03-04 15:29:01,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:01,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333009652] [2025-03-04 15:29:01,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:01,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:01,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:29:01,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:29:01,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:01,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:01,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:01,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333009652] [2025-03-04 15:29:01,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333009652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:01,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96960411] [2025-03-04 15:29:01,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:01,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:01,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:01,672 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:29:01,674 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:29:01,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:29:01,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:29:01,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:01,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:01,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 15:29:01,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:01,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:29:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:01,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:01,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 15:29:01,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:29:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:01,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96960411] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:01,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:01,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 15:29:01,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899961156] [2025-03-04 15:29:01,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:01,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:29:01,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:01,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:29:01,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:29:01,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 65 [2025-03-04 15:29:01,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 76 transitions, 366 flow. Second operand has 13 states, 13 states have (on average 23.0) internal successors, (299), 13 states have internal predecessors, (299), 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:29:01,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:01,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 65 [2025-03-04 15:29:01,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:02,867 INFO L124 PetriNetUnfolderBase]: 7018/11767 cut-off events. [2025-03-04 15:29:02,867 INFO L125 PetriNetUnfolderBase]: For 14446/14446 co-relation queries the response was YES. [2025-03-04 15:29:02,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35158 conditions, 11767 events. 7018/11767 cut-off events. For 14446/14446 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 90151 event pairs, 2026 based on Foata normal form. 310/9541 useless extension candidates. Maximal degree in co-relation 35117. Up to 3906 conditions per place. [2025-03-04 15:29:02,912 INFO L140 encePairwiseOnDemand]: 53/65 looper letters, 89 selfloop transitions, 15 changer transitions 0/122 dead transitions. [2025-03-04 15:29:02,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 122 transitions, 786 flow [2025-03-04 15:29:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:29:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:29:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 252 transitions. [2025-03-04 15:29:02,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4846153846153846 [2025-03-04 15:29:02,913 INFO L175 Difference]: Start difference. First operand has 92 places, 76 transitions, 366 flow. Second operand 8 states and 252 transitions. [2025-03-04 15:29:02,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 122 transitions, 786 flow [2025-03-04 15:29:02,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 122 transitions, 776 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:29:02,921 INFO L231 Difference]: Finished difference. Result has 95 places, 75 transitions, 382 flow [2025-03-04 15:29:02,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=382, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2025-03-04 15:29:02,921 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 29 predicate places. [2025-03-04 15:29:02,922 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 382 flow [2025-03-04 15:29:02,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 23.0) internal successors, (299), 13 states have internal predecessors, (299), 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:29:02,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:02,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:02,928 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:29:03,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:03,123 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:29:03,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:03,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1764622681, now seen corresponding path program 1 times [2025-03-04 15:29:03,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:03,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906412245] [2025-03-04 15:29:03,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:03,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:03,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:03,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:03,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:03,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:03,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:03,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906412245] [2025-03-04 15:29:03,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906412245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:03,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799704452] [2025-03-04 15:29:03,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:03,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:03,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:03,317 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:29:03,319 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:29:03,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:03,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:03,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:03,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:03,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:29:03,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:03,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 15:29:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:03,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:03,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-04 15:29:03,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2025-03-04 15:29:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:03,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799704452] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:03,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:03,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-04 15:29:03,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792790021] [2025-03-04 15:29:03,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:03,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 15:29:03,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:03,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:29:03,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:29:04,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 65 [2025-03-04 15:29:04,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 75 transitions, 382 flow. Second operand has 20 states, 20 states have (on average 19.8) internal successors, (396), 20 states have internal predecessors, (396), 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:29:04,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:04,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 65 [2025-03-04 15:29:04,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:08,258 INFO L124 PetriNetUnfolderBase]: 28447/44320 cut-off events. [2025-03-04 15:29:08,258 INFO L125 PetriNetUnfolderBase]: For 70902/70902 co-relation queries the response was YES. [2025-03-04 15:29:08,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144123 conditions, 44320 events. 28447/44320 cut-off events. For 70902/70902 co-relation queries the response was YES. Maximal size of possible extension queue 2259. Compared 366596 event pairs, 10806 based on Foata normal form. 0/34011 useless extension candidates. Maximal degree in co-relation 144081. Up to 8965 conditions per place. [2025-03-04 15:29:08,598 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 284 selfloop transitions, 35 changer transitions 0/335 dead transitions. [2025-03-04 15:29:08,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 335 transitions, 2510 flow [2025-03-04 15:29:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:29:08,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:29:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 510 transitions. [2025-03-04 15:29:08,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2025-03-04 15:29:08,600 INFO L175 Difference]: Start difference. First operand has 95 places, 75 transitions, 382 flow. Second operand 15 states and 510 transitions. [2025-03-04 15:29:08,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 335 transitions, 2510 flow [2025-03-04 15:29:08,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 335 transitions, 2473 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:08,622 INFO L231 Difference]: Finished difference. Result has 109 places, 101 transitions, 575 flow [2025-03-04 15:29:08,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=575, PETRI_PLACES=109, PETRI_TRANSITIONS=101} [2025-03-04 15:29:08,622 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 43 predicate places. [2025-03-04 15:29:08,622 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 101 transitions, 575 flow [2025-03-04 15:29:08,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 19.8) internal successors, (396), 20 states have internal predecessors, (396), 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:29:08,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:08,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:08,628 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:29:08,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:08,823 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:29:08,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:08,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1764622680, now seen corresponding path program 1 times [2025-03-04 15:29:08,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:08,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865527607] [2025-03-04 15:29:08,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:08,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:08,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:08,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:08,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:08,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:09,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:09,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:09,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865527607] [2025-03-04 15:29:09,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865527607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:09,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185645256] [2025-03-04 15:29:09,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:09,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:09,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:09,070 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:29:09,071 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:29:09,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:09,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:09,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:09,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:09,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 15:29:09,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:09,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-04 15:29:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:09,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:09,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:29:09,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2025-03-04 15:29:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:09,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185645256] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:09,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:09,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-04 15:29:09,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948876843] [2025-03-04 15:29:09,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:09,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 15:29:09,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:09,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:29:09,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:29:09,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 65 [2025-03-04 15:29:09,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 101 transitions, 575 flow. Second operand has 20 states, 20 states have (on average 19.8) internal successors, (396), 20 states have internal predecessors, (396), 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:29:09,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:09,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 65 [2025-03-04 15:29:09,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:14,308 INFO L124 PetriNetUnfolderBase]: 27421/42952 cut-off events. [2025-03-04 15:29:14,308 INFO L125 PetriNetUnfolderBase]: For 71449/71449 co-relation queries the response was YES. [2025-03-04 15:29:14,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155381 conditions, 42952 events. 27421/42952 cut-off events. For 71449/71449 co-relation queries the response was YES. Maximal size of possible extension queue 2188. Compared 358382 event pairs, 10806 based on Foata normal form. 536/34735 useless extension candidates. Maximal degree in co-relation 155333. Up to 8845 conditions per place. [2025-03-04 15:29:14,646 INFO L140 encePairwiseOnDemand]: 52/65 looper letters, 282 selfloop transitions, 35 changer transitions 0/333 dead transitions. [2025-03-04 15:29:14,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 333 transitions, 2615 flow [2025-03-04 15:29:14,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 15:29:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 15:29:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 508 transitions. [2025-03-04 15:29:14,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.521025641025641 [2025-03-04 15:29:14,648 INFO L175 Difference]: Start difference. First operand has 109 places, 101 transitions, 575 flow. Second operand 15 states and 508 transitions. [2025-03-04 15:29:14,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 333 transitions, 2615 flow [2025-03-04 15:29:14,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 333 transitions, 2606 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:29:14,872 INFO L231 Difference]: Finished difference. Result has 119 places, 101 transitions, 640 flow [2025-03-04 15:29:14,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=640, PETRI_PLACES=119, PETRI_TRANSITIONS=101} [2025-03-04 15:29:14,872 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 53 predicate places. [2025-03-04 15:29:14,873 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 101 transitions, 640 flow [2025-03-04 15:29:14,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 19.8) internal successors, (396), 20 states have internal predecessors, (396), 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:29:14,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:14,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:14,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:29:15,073 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,SelfDestructingSolverStorable15 [2025-03-04 15:29:15,073 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:29:15,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:15,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1746188011, now seen corresponding path program 1 times [2025-03-04 15:29:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:15,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752142163] [2025-03-04 15:29:15,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:15,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:15,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:15,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:15,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:15,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:15,104 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:29:15,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:15,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752142163] [2025-03-04 15:29:15,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752142163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:15,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:15,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:15,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662413117] [2025-03-04 15:29:15,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:15,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:15,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:15,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:15,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:15,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 65 [2025-03-04 15:29:15,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 101 transitions, 640 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:15,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:15,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 65 [2025-03-04 15:29:15,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:20,323 INFO L124 PetriNetUnfolderBase]: 31490/48647 cut-off events. [2025-03-04 15:29:20,324 INFO L125 PetriNetUnfolderBase]: For 97865/98901 co-relation queries the response was YES. [2025-03-04 15:29:20,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179847 conditions, 48647 events. 31490/48647 cut-off events. For 97865/98901 co-relation queries the response was YES. Maximal size of possible extension queue 2358. Compared 399570 event pairs, 16725 based on Foata normal form. 1868/42438 useless extension candidates. Maximal degree in co-relation 179798. Up to 31809 conditions per place. [2025-03-04 15:29:20,781 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 175 selfloop transitions, 4 changer transitions 0/196 dead transitions. [2025-03-04 15:29:20,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 196 transitions, 1617 flow [2025-03-04 15:29:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:20,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2025-03-04 15:29:20,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6115384615384616 [2025-03-04 15:29:20,782 INFO L175 Difference]: Start difference. First operand has 119 places, 101 transitions, 640 flow. Second operand 4 states and 159 transitions. [2025-03-04 15:29:20,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 196 transitions, 1617 flow [2025-03-04 15:29:21,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 196 transitions, 1549 flow, removed 15 selfloop flow, removed 9 redundant places. [2025-03-04 15:29:21,183 INFO L231 Difference]: Finished difference. Result has 115 places, 102 transitions, 625 flow [2025-03-04 15:29:21,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=625, PETRI_PLACES=115, PETRI_TRANSITIONS=102} [2025-03-04 15:29:21,184 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 49 predicate places. [2025-03-04 15:29:21,184 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 102 transitions, 625 flow [2025-03-04 15:29:21,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:21,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:21,184 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:21,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:29:21,184 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:29:21,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:21,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1542966376, now seen corresponding path program 1 times [2025-03-04 15:29:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:21,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63602827] [2025-03-04 15:29:21,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:21,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:21,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:21,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:21,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:21,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:21,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:21,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63602827] [2025-03-04 15:29:21,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63602827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:21,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765469380] [2025-03-04 15:29:21,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:21,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:21,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:21,291 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:29:21,292 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:29:21,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:29:21,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:29:21,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:21,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:21,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:29:21,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:21,450 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:29:21,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:21,524 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:29:21,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765469380] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:21,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:21,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-04 15:29:21,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122623451] [2025-03-04 15:29:21,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:21,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 15:29:21,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:21,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 15:29:21,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-04 15:29:21,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 65 [2025-03-04 15:29:21,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 102 transitions, 625 flow. Second operand has 20 states, 20 states have (on average 16.55) internal successors, (331), 20 states have internal predecessors, (331), 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:29:21,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:21,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 65 [2025-03-04 15:29:21,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:26,188 INFO L124 PetriNetUnfolderBase]: 28635/43486 cut-off events. [2025-03-04 15:29:26,188 INFO L125 PetriNetUnfolderBase]: For 97450/98783 co-relation queries the response was YES. [2025-03-04 15:29:26,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166340 conditions, 43486 events. 28635/43486 cut-off events. For 97450/98783 co-relation queries the response was YES. Maximal size of possible extension queue 1932. Compared 339076 event pairs, 20708 based on Foata normal form. 689/35563 useless extension candidates. Maximal degree in co-relation 166291. Up to 30864 conditions per place. [2025-03-04 15:29:26,481 INFO L140 encePairwiseOnDemand]: 56/65 looper letters, 201 selfloop transitions, 16 changer transitions 0/232 dead transitions. [2025-03-04 15:29:26,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 232 transitions, 1830 flow [2025-03-04 15:29:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:26,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 291 transitions. [2025-03-04 15:29:26,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44769230769230767 [2025-03-04 15:29:26,482 INFO L175 Difference]: Start difference. First operand has 115 places, 102 transitions, 625 flow. Second operand 10 states and 291 transitions. [2025-03-04 15:29:26,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 232 transitions, 1830 flow [2025-03-04 15:29:26,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 232 transitions, 1800 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:26,606 INFO L231 Difference]: Finished difference. Result has 126 places, 107 transitions, 705 flow [2025-03-04 15:29:26,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=705, PETRI_PLACES=126, PETRI_TRANSITIONS=107} [2025-03-04 15:29:26,607 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 60 predicate places. [2025-03-04 15:29:26,607 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 107 transitions, 705 flow [2025-03-04 15:29:26,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 16.55) internal successors, (331), 20 states have internal predecessors, (331), 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:29:26,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:26,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:26,613 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:29:26,807 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,SelfDestructingSolverStorable17 [2025-03-04 15:29:26,808 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 15:29:26,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:26,808 INFO L85 PathProgramCache]: Analyzing trace with hash 709713166, now seen corresponding path program 1 times [2025-03-04 15:29:26,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:26,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780591971] [2025-03-04 15:29:26,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:26,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:26,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:29:26,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:29:26,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:26,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:26,843 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:29:26,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:26,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780591971] [2025-03-04 15:29:26,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780591971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:26,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:26,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:29:26,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362472306] [2025-03-04 15:29:26,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:26,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:29:26,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:26,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:29:26,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:29:26,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 65 [2025-03-04 15:29:26,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 107 transitions, 705 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 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:29:26,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:26,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 65 [2025-03-04 15:29:26,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand