./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-min.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 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:44:01,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:44:01,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:44:01,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:44:01,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:44:01,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:44:01,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:44:01,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:44:01,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:44:01,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:44:01,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:44:01,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:44:01,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:44:01,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:44:01,903 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:44:01,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:44:01,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:44:01,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:44:01,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:44:01,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:44:01,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:44:01,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:44:01,905 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:44:01,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:44:01,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:44:01,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:44:01,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:44:01,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:44:01,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:44:01,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:44:01,905 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 -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2025-03-09 06:44:02,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:44:02,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:44:02,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:44:02,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:44:02,137 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:44:02,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-03-09 06:44:03,325 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de55a087d/08c584856cd1415face1a872456fa3dc/FLAG6b582ebcb [2025-03-09 06:44:03,514 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:44:03,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-03-09 06:44:03,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de55a087d/08c584856cd1415face1a872456fa3dc/FLAG6b582ebcb [2025-03-09 06:44:03,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de55a087d/08c584856cd1415face1a872456fa3dc [2025-03-09 06:44:03,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:44:03,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:44:03,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:44:03,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:44:03,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:44:03,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:44:03" (1/1) ... [2025-03-09 06:44:03,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576a90c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03, skipping insertion in model container [2025-03-09 06:44:03,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:44:03" (1/1) ... [2025-03-09 06:44:03,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:44:03,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:44:03,675 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:44:03,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:44:03,713 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:44:03,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03 WrapperNode [2025-03-09 06:44:03,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:44:03,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:44:03,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:44:03,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:44:03,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03" (1/1) ... [2025-03-09 06:44:03,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03" (1/1) ... [2025-03-09 06:44:03,738 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 264 [2025-03-09 06:44:03,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:44:03,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:44:03,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:44:03,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:44:03,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03" (1/1) ... [2025-03-09 06:44:03,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03" (1/1) ... [2025-03-09 06:44:03,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03" (1/1) ... [2025-03-09 06:44:03,758 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-03-09 06:44:03,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03" (1/1) ... [2025-03-09 06:44:03,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03" (1/1) ... [2025-03-09 06:44:03,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03" (1/1) ... [2025-03-09 06:44:03,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03" (1/1) ... [2025-03-09 06:44:03,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03" (1/1) ... [2025-03-09 06:44:03,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03" (1/1) ... [2025-03-09 06:44:03,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:44:03,774 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:44:03,775 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:44:03,775 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:44:03,776 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03" (1/1) ... [2025-03-09 06:44:03,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:44:03,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:03,804 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-09 06:44:03,809 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-09 06:44:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:44:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 06:44:03,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 06:44:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 06:44:03,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 06:44:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 06:44:03,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 06:44:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:44:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:44:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:44:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:44:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 06:44:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 06:44:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:44:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:44:03,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:44:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:44:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:44:03,827 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:44:03,904 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:44:03,906 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:44:04,325 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:44:04,325 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:44:04,621 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:44:04,622 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:44:04,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:44:04 BoogieIcfgContainer [2025-03-09 06:44:04,622 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:44:04,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:44:04,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:44:04,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:44:04,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:44:03" (1/3) ... [2025-03-09 06:44:04,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6be0e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:44:04, skipping insertion in model container [2025-03-09 06:44:04,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:44:03" (2/3) ... [2025-03-09 06:44:04,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6be0e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:44:04, skipping insertion in model container [2025-03-09 06:44:04,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:44:04" (3/3) ... [2025-03-09 06:44:04,630 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2025-03-09 06:44:04,642 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:44:04,643 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-min.wvr.c that has 4 procedures, 95 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-03-09 06:44:04,644 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:44:04,718 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 06:44:04,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 105 transitions, 231 flow [2025-03-09 06:44:04,788 INFO L124 PetriNetUnfolderBase]: 11/102 cut-off events. [2025-03-09 06:44:04,790 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 06:44:04,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 11/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 266 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-09 06:44:04,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 105 transitions, 231 flow [2025-03-09 06:44:04,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 220 flow [2025-03-09 06:44:04,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:44:04,820 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;@7ada6b4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:44:04,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-03-09 06:44:04,826 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:44:04,827 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-09 06:44:04,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:44:04,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:04,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 06:44:04,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:04,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:04,832 INFO L85 PathProgramCache]: Analyzing trace with hash 910156, now seen corresponding path program 1 times [2025-03-09 06:44:04,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:04,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845923459] [2025-03-09 06:44:04,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:04,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:04,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:44:04,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:44:04,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:04,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:05,045 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-09 06:44:05,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:05,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845923459] [2025-03-09 06:44:05,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845923459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:44:05,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:44:05,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:44:05,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892335380] [2025-03-09 06:44:05,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:44:05,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:44:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:05,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:44:05,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:44:05,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-09 06:44:05,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:05,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:05,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-09 06:44:05,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:05,522 INFO L124 PetriNetUnfolderBase]: 1374/2592 cut-off events. [2025-03-09 06:44:05,523 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2025-03-09 06:44:05,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4608 conditions, 2592 events. 1374/2592 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17041 event pairs, 1018 based on Foata normal form. 3/1922 useless extension candidates. Maximal degree in co-relation 4086. Up to 1857 conditions per place. [2025-03-09 06:44:05,548 INFO L140 encePairwiseOnDemand]: 87/105 looper letters, 53 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2025-03-09 06:44:05,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 108 transitions, 360 flow [2025-03-09 06:44:05,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:44:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:44:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 263 transitions. [2025-03-09 06:44:05,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6261904761904762 [2025-03-09 06:44:05,563 INFO L175 Difference]: Start difference. First operand has 100 places, 101 transitions, 220 flow. Second operand 4 states and 263 transitions. [2025-03-09 06:44:05,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 108 transitions, 360 flow [2025-03-09 06:44:05,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 108 transitions, 348 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 06:44:05,571 INFO L231 Difference]: Finished difference. Result has 98 places, 108 transitions, 292 flow [2025-03-09 06:44:05,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=98, PETRI_TRANSITIONS=108} [2025-03-09 06:44:05,575 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2025-03-09 06:44:05,575 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 292 flow [2025-03-09 06:44:05,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:05,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:05,575 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-09 06:44:05,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:44:05,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:05,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:05,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1345439807, now seen corresponding path program 1 times [2025-03-09 06:44:05,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:05,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163923475] [2025-03-09 06:44:05,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:05,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:05,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:44:05,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:44:05,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:05,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:05,708 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-09 06:44:05,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:05,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163923475] [2025-03-09 06:44:05,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163923475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:05,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241629814] [2025-03-09 06:44:05,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:05,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:05,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:05,713 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-09 06:44:05,714 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-09 06:44:05,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:44:05,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:44:05,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:05,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:05,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:44:05,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:05,828 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-09 06:44:05,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:44:05,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241629814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:44:05,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:44:05,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 06:44:05,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739929416] [2025-03-09 06:44:05,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:44:05,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:44:05,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:05,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:44:05,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:44:05,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-09 06:44:05,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 108 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 48.833333333333336) internal successors, (293), 6 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:05,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:05,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-09 06:44:05,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:06,196 INFO L124 PetriNetUnfolderBase]: 1374/2589 cut-off events. [2025-03-09 06:44:06,198 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-03-09 06:44:06,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4532 conditions, 2589 events. 1374/2589 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17056 event pairs, 1018 based on Foata normal form. 3/1924 useless extension candidates. Maximal degree in co-relation 4459. Up to 1842 conditions per place. [2025-03-09 06:44:06,212 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 43 selfloop transitions, 17 changer transitions 0/105 dead transitions. [2025-03-09 06:44:06,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 105 transitions, 400 flow [2025-03-09 06:44:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:44:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:44:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 351 transitions. [2025-03-09 06:44:06,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-03-09 06:44:06,214 INFO L175 Difference]: Start difference. First operand has 98 places, 108 transitions, 292 flow. Second operand 6 states and 351 transitions. [2025-03-09 06:44:06,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 105 transitions, 400 flow [2025-03-09 06:44:06,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 105 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:44:06,216 INFO L231 Difference]: Finished difference. Result has 100 places, 105 transitions, 314 flow [2025-03-09 06:44:06,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=100, PETRI_TRANSITIONS=105} [2025-03-09 06:44:06,218 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2025-03-09 06:44:06,218 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 105 transitions, 314 flow [2025-03-09 06:44:06,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.833333333333336) internal successors, (293), 6 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:06,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:06,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:44:06,226 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-09 06:44:06,423 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-09 06:44:06,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:06,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:06,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1346612458, now seen corresponding path program 1 times [2025-03-09 06:44:06,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:06,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285857462] [2025-03-09 06:44:06,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:06,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:06,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:44:06,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:44:06,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:06,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:06,517 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-09 06:44:06,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:06,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285857462] [2025-03-09 06:44:06,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285857462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:44:06,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:44:06,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:44:06,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910917158] [2025-03-09 06:44:06,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:44:06,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:44:06,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:06,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:44:06,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:44:06,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-09 06:44:06,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 105 transitions, 314 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:06,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:06,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-09 06:44:06,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:06,870 INFO L124 PetriNetUnfolderBase]: 1375/2606 cut-off events. [2025-03-09 06:44:06,870 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-09 06:44:06,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4581 conditions, 2606 events. 1375/2606 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17081 event pairs, 1018 based on Foata normal form. 4/1941 useless extension candidates. Maximal degree in co-relation 4495. Up to 1857 conditions per place. [2025-03-09 06:44:06,886 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 64 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2025-03-09 06:44:06,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 110 transitions, 472 flow [2025-03-09 06:44:06,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:44:06,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:44:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-09 06:44:06,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.569047619047619 [2025-03-09 06:44:06,888 INFO L175 Difference]: Start difference. First operand has 100 places, 105 transitions, 314 flow. Second operand 4 states and 239 transitions. [2025-03-09 06:44:06,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 110 transitions, 472 flow [2025-03-09 06:44:06,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 110 transitions, 434 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-09 06:44:06,893 INFO L231 Difference]: Finished difference. Result has 99 places, 108 transitions, 340 flow [2025-03-09 06:44:06,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=99, PETRI_TRANSITIONS=108} [2025-03-09 06:44:06,894 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -1 predicate places. [2025-03-09 06:44:06,894 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 340 flow [2025-03-09 06:44:06,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:06,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:06,895 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-09 06:44:06,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:44:06,895 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:06,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:06,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1241038155, now seen corresponding path program 1 times [2025-03-09 06:44:06,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:06,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218101285] [2025-03-09 06:44:06,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:06,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:06,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:44:06,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:44:06,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:06,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:07,009 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-09 06:44:07,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:07,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218101285] [2025-03-09 06:44:07,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218101285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:07,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167890993] [2025-03-09 06:44:07,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:07,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:07,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:07,013 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-09 06:44:07,015 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-09 06:44:07,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:44:07,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:44:07,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:07,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:07,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:44:07,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:07,098 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-09 06:44:07,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:07,134 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-09 06:44:07,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167890993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:07,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:07,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-09 06:44:07,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815945293] [2025-03-09 06:44:07,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:07,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:44:07,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:07,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:44:07,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:44:07,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-09 06:44:07,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 108 transitions, 340 flow. Second operand has 12 states, 12 states have (on average 49.083333333333336) internal successors, (589), 12 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:07,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:07,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-09 06:44:07,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:07,496 INFO L124 PetriNetUnfolderBase]: 1384/2642 cut-off events. [2025-03-09 06:44:07,496 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-03-09 06:44:07,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4689 conditions, 2642 events. 1384/2642 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17378 event pairs, 1018 based on Foata normal form. 9/1981 useless extension candidates. Maximal degree in co-relation 4506. Up to 1862 conditions per place. [2025-03-09 06:44:07,508 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 53 selfloop transitions, 37 changer transitions 0/135 dead transitions. [2025-03-09 06:44:07,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 135 transitions, 661 flow [2025-03-09 06:44:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:44:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:44:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 576 transitions. [2025-03-09 06:44:07,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5485714285714286 [2025-03-09 06:44:07,511 INFO L175 Difference]: Start difference. First operand has 99 places, 108 transitions, 340 flow. Second operand 10 states and 576 transitions. [2025-03-09 06:44:07,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 135 transitions, 661 flow [2025-03-09 06:44:07,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 135 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:44:07,516 INFO L231 Difference]: Finished difference. Result has 111 places, 135 transitions, 605 flow [2025-03-09 06:44:07,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=605, PETRI_PLACES=111, PETRI_TRANSITIONS=135} [2025-03-09 06:44:07,518 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-03-09 06:44:07,518 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 135 transitions, 605 flow [2025-03-09 06:44:07,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 49.083333333333336) internal successors, (589), 12 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:07,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:07,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:07,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:44:07,720 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-09 06:44:07,720 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:07,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:07,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1204685938, now seen corresponding path program 1 times [2025-03-09 06:44:07,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:07,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709957306] [2025-03-09 06:44:07,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:07,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:07,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:44:07,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:44:07,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:07,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:07,789 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-09 06:44:07,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:07,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709957306] [2025-03-09 06:44:07,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709957306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:44:07,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:44:07,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:44:07,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364814089] [2025-03-09 06:44:07,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:44:07,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:44:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:07,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:44:07,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:44:07,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 105 [2025-03-09 06:44:07,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 135 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:07,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:07,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 105 [2025-03-09 06:44:07,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:08,013 INFO L124 PetriNetUnfolderBase]: 1383/2641 cut-off events. [2025-03-09 06:44:08,013 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2025-03-09 06:44:08,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4749 conditions, 2641 events. 1383/2641 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17310 event pairs, 1018 based on Foata normal form. 1/1978 useless extension candidates. Maximal degree in co-relation 4646. Up to 1888 conditions per place. [2025-03-09 06:44:08,045 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 84 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-03-09 06:44:08,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 134 transitions, 773 flow [2025-03-09 06:44:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:44:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:44:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-03-09 06:44:08,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6761904761904762 [2025-03-09 06:44:08,048 INFO L175 Difference]: Start difference. First operand has 111 places, 135 transitions, 605 flow. Second operand 3 states and 213 transitions. [2025-03-09 06:44:08,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 134 transitions, 773 flow [2025-03-09 06:44:08,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 134 transitions, 736 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-09 06:44:08,053 INFO L231 Difference]: Finished difference. Result has 111 places, 134 transitions, 568 flow [2025-03-09 06:44:08,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=111, PETRI_TRANSITIONS=134} [2025-03-09 06:44:08,053 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-03-09 06:44:08,053 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 134 transitions, 568 flow [2025-03-09 06:44:08,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:08,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:08,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:08,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:44:08,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:08,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:08,054 INFO L85 PathProgramCache]: Analyzing trace with hash -651942143, now seen corresponding path program 1 times [2025-03-09 06:44:08,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:08,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993122893] [2025-03-09 06:44:08,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:08,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:08,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:44:08,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:44:08,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:08,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:08,143 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-09 06:44:08,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:08,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993122893] [2025-03-09 06:44:08,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993122893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:44:08,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:44:08,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:44:08,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867512022] [2025-03-09 06:44:08,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:44:08,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:44:08,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:08,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:44:08,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:44:08,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 105 [2025-03-09 06:44:08,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 134 transitions, 568 flow. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:08,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:08,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 105 [2025-03-09 06:44:08,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:08,400 INFO L124 PetriNetUnfolderBase]: 1381/2639 cut-off events. [2025-03-09 06:44:08,400 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-09 06:44:08,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 2639 events. 1381/2639 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17160 event pairs, 1018 based on Foata normal form. 2/1977 useless extension candidates. Maximal degree in co-relation 4697. Up to 1875 conditions per place. [2025-03-09 06:44:08,413 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 72 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2025-03-09 06:44:08,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 132 transitions, 723 flow [2025-03-09 06:44:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:44:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:44:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2025-03-09 06:44:08,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2025-03-09 06:44:08,414 INFO L175 Difference]: Start difference. First operand has 111 places, 134 transitions, 568 flow. Second operand 4 states and 272 transitions. [2025-03-09 06:44:08,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 132 transitions, 723 flow [2025-03-09 06:44:08,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 132 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:44:08,417 INFO L231 Difference]: Finished difference. Result has 112 places, 132 transitions, 565 flow [2025-03-09 06:44:08,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=565, PETRI_PLACES=112, PETRI_TRANSITIONS=132} [2025-03-09 06:44:08,418 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 12 predicate places. [2025-03-09 06:44:08,418 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 132 transitions, 565 flow [2025-03-09 06:44:08,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:08,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:08,418 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-09 06:44:08,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:44:08,418 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:08,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1797833976, now seen corresponding path program 2 times [2025-03-09 06:44:08,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:08,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512492089] [2025-03-09 06:44:08,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:44:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:08,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 06:44:08,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-09 06:44:08,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:44:08,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:44:08,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:08,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512492089] [2025-03-09 06:44:08,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512492089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:08,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638844073] [2025-03-09 06:44:08,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:44:08,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:08,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:08,465 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-09 06:44:08,466 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-09 06:44:08,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 06:44:08,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-09 06:44:08,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:44:08,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:08,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:44:08,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:44:08,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 06:44:08,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638844073] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:08,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:08,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-03-09 06:44:08,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456570834] [2025-03-09 06:44:08,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:08,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:44:08,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:08,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:44:08,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:44:08,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-09 06:44:08,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 132 transitions, 565 flow. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:08,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:08,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-09 06:44:08,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:08,837 INFO L124 PetriNetUnfolderBase]: 1381/2638 cut-off events. [2025-03-09 06:44:08,838 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-03-09 06:44:08,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4722 conditions, 2638 events. 1381/2638 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17149 event pairs, 1018 based on Foata normal form. 1/1977 useless extension candidates. Maximal degree in co-relation 4626. Up to 1879 conditions per place. [2025-03-09 06:44:08,847 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 71 selfloop transitions, 15 changer transitions 0/131 dead transitions. [2025-03-09 06:44:08,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 131 transitions, 727 flow [2025-03-09 06:44:08,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:44:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:44:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2025-03-09 06:44:08,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5785714285714286 [2025-03-09 06:44:08,848 INFO L175 Difference]: Start difference. First operand has 112 places, 132 transitions, 565 flow. Second operand 4 states and 243 transitions. [2025-03-09 06:44:08,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 131 transitions, 727 flow [2025-03-09 06:44:08,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 131 transitions, 703 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:44:08,851 INFO L231 Difference]: Finished difference. Result has 111 places, 131 transitions, 561 flow [2025-03-09 06:44:08,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=561, PETRI_PLACES=111, PETRI_TRANSITIONS=131} [2025-03-09 06:44:08,853 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-03-09 06:44:08,853 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 131 transitions, 561 flow [2025-03-09 06:44:08,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:08,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:08,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:08,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 06:44:09,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:09,059 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:09,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash -6733540, now seen corresponding path program 1 times [2025-03-09 06:44:09,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:09,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613234542] [2025-03-09 06:44:09,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:09,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:09,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:44:09,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:44:09,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:09,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:44:09,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613234542] [2025-03-09 06:44:09,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613234542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343197061] [2025-03-09 06:44:09,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:09,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:09,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:09,375 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-09 06:44:09,377 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-09 06:44:09,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:44:09,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:44:09,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:09,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:09,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:44:09,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:09,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:44:09,481 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-09 06:44:09,513 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:44:09,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:44:09,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 06:44:09,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 06:44:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:44:09,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:09,574 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_100 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_100) c_~B~0.base) c_~B~0.offset) 9223372039002259456))) is different from false [2025-03-09 06:44:09,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:09,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-09 06:44:09,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:09,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-03-09 06:44:09,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-09 06:44:09,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-03-09 06:44:09,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343197061] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:09,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:09,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 06:44:09,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074933704] [2025-03-09 06:44:09,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:09,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 06:44:09,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:09,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 06:44:09,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2025-03-09 06:44:09,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 105 [2025-03-09 06:44:09,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 131 transitions, 561 flow. Second operand has 14 states, 14 states have (on average 37.857142857142854) internal successors, (530), 14 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:09,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:09,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 105 [2025-03-09 06:44:09,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:10,149 INFO L124 PetriNetUnfolderBase]: 1379/2641 cut-off events. [2025-03-09 06:44:10,149 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-03-09 06:44:10,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4755 conditions, 2641 events. 1379/2641 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17161 event pairs, 1018 based on Foata normal form. 0/1975 useless extension candidates. Maximal degree in co-relation 4664. Up to 1841 conditions per place. [2025-03-09 06:44:10,159 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 86 selfloop transitions, 24 changer transitions 0/139 dead transitions. [2025-03-09 06:44:10,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 139 transitions, 797 flow [2025-03-09 06:44:10,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:44:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 06:44:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 477 transitions. [2025-03-09 06:44:10,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.412987012987013 [2025-03-09 06:44:10,161 INFO L175 Difference]: Start difference. First operand has 111 places, 131 transitions, 561 flow. Second operand 11 states and 477 transitions. [2025-03-09 06:44:10,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 139 transitions, 797 flow [2025-03-09 06:44:10,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 139 transitions, 767 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:44:10,164 INFO L231 Difference]: Finished difference. Result has 117 places, 130 transitions, 577 flow [2025-03-09 06:44:10,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=577, PETRI_PLACES=117, PETRI_TRANSITIONS=130} [2025-03-09 06:44:10,164 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 17 predicate places. [2025-03-09 06:44:10,164 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 130 transitions, 577 flow [2025-03-09 06:44:10,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 37.857142857142854) internal successors, (530), 14 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:10,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:10,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:10,171 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-09 06:44:10,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:10,365 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:10,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:10,366 INFO L85 PathProgramCache]: Analyzing trace with hash -208709507, now seen corresponding path program 1 times [2025-03-09 06:44:10,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:10,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303830550] [2025-03-09 06:44:10,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:10,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:10,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:44:10,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:44:10,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:10,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:44:10,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:10,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303830550] [2025-03-09 06:44:10,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303830550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:10,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394401340] [2025-03-09 06:44:10,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:10,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:10,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:10,605 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-09 06:44:10,607 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-09 06:44:10,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:44:10,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:44:10,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:10,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:10,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 06:44:10,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:10,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:44:10,711 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-09 06:44:10,735 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:44:10,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:44:10,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 06:44:10,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:44:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:44:10,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:10,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:10,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-09 06:44:10,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:10,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-03-09 06:44:10,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-09 06:44:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:44:10,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394401340] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:10,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:10,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 06:44:10,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930836958] [2025-03-09 06:44:10,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:10,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 06:44:10,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:10,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 06:44:10,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2025-03-09 06:44:10,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 105 [2025-03-09 06:44:10,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 130 transitions, 577 flow. Second operand has 14 states, 14 states have (on average 37.857142857142854) internal successors, (530), 14 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:10,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:10,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 105 [2025-03-09 06:44:10,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:11,513 INFO L124 PetriNetUnfolderBase]: 1379/2640 cut-off events. [2025-03-09 06:44:11,513 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2025-03-09 06:44:11,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4761 conditions, 2640 events. 1379/2640 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17168 event pairs, 1018 based on Foata normal form. 1/1978 useless extension candidates. Maximal degree in co-relation 4666. Up to 1845 conditions per place. [2025-03-09 06:44:11,520 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 79 selfloop transitions, 25 changer transitions 0/133 dead transitions. [2025-03-09 06:44:11,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 133 transitions, 789 flow [2025-03-09 06:44:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:44:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 06:44:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 469 transitions. [2025-03-09 06:44:11,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2025-03-09 06:44:11,523 INFO L175 Difference]: Start difference. First operand has 117 places, 130 transitions, 577 flow. Second operand 11 states and 469 transitions. [2025-03-09 06:44:11,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 133 transitions, 789 flow [2025-03-09 06:44:11,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 133 transitions, 762 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:44:11,527 INFO L231 Difference]: Finished difference. Result has 122 places, 129 transitions, 596 flow [2025-03-09 06:44:11,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=596, PETRI_PLACES=122, PETRI_TRANSITIONS=129} [2025-03-09 06:44:11,528 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 22 predicate places. [2025-03-09 06:44:11,528 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 596 flow [2025-03-09 06:44:11,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 37.857142857142854) internal successors, (530), 14 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:11,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:11,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:11,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:44:11,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:11,729 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:11,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:11,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2119942174, now seen corresponding path program 1 times [2025-03-09 06:44:11,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:11,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160073058] [2025-03-09 06:44:11,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:11,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:11,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:44:11,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:44:11,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:11,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:12,052 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-09 06:44:12,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:12,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160073058] [2025-03-09 06:44:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160073058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:12,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251568244] [2025-03-09 06:44:12,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:12,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:12,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:12,055 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-09 06:44:12,056 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-09 06:44:12,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 06:44:12,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 06:44:12,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:12,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:12,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 06:44:12,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:12,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:44:12,146 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-09 06:44:12,165 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 06:44:12,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 06:44:12,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 06:44:12,191 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:44:12,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:44:12,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 06:44:12,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 06:44:12,249 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-09 06:44:12,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:12,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_157 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_157) c_~A~0.base) c_~A~0.offset)))) is different from false [2025-03-09 06:44:12,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:12,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-03-09 06:44:12,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:12,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 135 [2025-03-09 06:44:12,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-03-09 06:44:12,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-03-09 06:44:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-09 06:44:12,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251568244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:12,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:12,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-09 06:44:12,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508150176] [2025-03-09 06:44:12,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:12,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 06:44:12,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:12,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 06:44:12,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=225, Unknown=2, NotChecked=30, Total=306 [2025-03-09 06:44:12,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 105 [2025-03-09 06:44:12,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 129 transitions, 596 flow. Second operand has 18 states, 18 states have (on average 33.611111111111114) internal successors, (605), 18 states have internal predecessors, (605), 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-09 06:44:12,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:12,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 105 [2025-03-09 06:44:12,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:13,118 INFO L124 PetriNetUnfolderBase]: 1378/2636 cut-off events. [2025-03-09 06:44:13,118 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2025-03-09 06:44:13,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4763 conditions, 2636 events. 1378/2636 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17116 event pairs, 1018 based on Foata normal form. 1/1977 useless extension candidates. Maximal degree in co-relation 4668. Up to 1842 conditions per place. [2025-03-09 06:44:13,128 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 81 selfloop transitions, 28 changer transitions 0/134 dead transitions. [2025-03-09 06:44:13,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 134 transitions, 822 flow [2025-03-09 06:44:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 06:44:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 06:44:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 534 transitions. [2025-03-09 06:44:13,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.363265306122449 [2025-03-09 06:44:13,130 INFO L175 Difference]: Start difference. First operand has 122 places, 129 transitions, 596 flow. Second operand 14 states and 534 transitions. [2025-03-09 06:44:13,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 134 transitions, 822 flow [2025-03-09 06:44:13,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 134 transitions, 770 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-03-09 06:44:13,133 INFO L231 Difference]: Finished difference. Result has 126 places, 128 transitions, 608 flow [2025-03-09 06:44:13,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=608, PETRI_PLACES=126, PETRI_TRANSITIONS=128} [2025-03-09 06:44:13,134 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 26 predicate places. [2025-03-09 06:44:13,134 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 128 transitions, 608 flow [2025-03-09 06:44:13,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 33.611111111111114) internal successors, (605), 18 states have internal predecessors, (605), 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-09 06:44:13,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:13,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:13,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 06:44:13,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:13,335 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:13,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:13,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1293698767, now seen corresponding path program 1 times [2025-03-09 06:44:13,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:13,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83674655] [2025-03-09 06:44:13,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:13,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:13,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:44:13,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:44:13,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:13,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:13,597 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-09 06:44:13,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:13,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83674655] [2025-03-09 06:44:13,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83674655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:13,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879519705] [2025-03-09 06:44:13,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:13,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:13,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:13,600 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-09 06:44:13,602 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-09 06:44:13,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:44:13,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:44:13,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:13,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:13,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 06:44:13,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:13,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:44:13,696 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-09 06:44:13,724 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 06:44:13,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 06:44:13,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 06:44:13,745 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:44:13,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:44:13,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 06:44:13,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:44:13,793 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-09 06:44:13,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:13,822 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_186 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_186) c_~A~0.base) c_~A~0.offset) 2147483648)) is different from false [2025-03-09 06:44:13,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:13,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-09 06:44:13,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:13,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 117 [2025-03-09 06:44:13,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-03-09 06:44:13,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-09 06:44:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-09 06:44:14,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879519705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:14,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:14,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-09 06:44:14,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301331487] [2025-03-09 06:44:14,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:14,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 06:44:14,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:14,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 06:44:14,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=287, Unknown=2, NotChecked=34, Total=380 [2025-03-09 06:44:14,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 105 [2025-03-09 06:44:14,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 128 transitions, 608 flow. Second operand has 20 states, 20 states have (on average 33.6) internal successors, (672), 20 states have internal predecessors, (672), 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-09 06:44:14,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:14,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 105 [2025-03-09 06:44:14,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:14,691 INFO L124 PetriNetUnfolderBase]: 1378/2636 cut-off events. [2025-03-09 06:44:14,691 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2025-03-09 06:44:14,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4782 conditions, 2636 events. 1378/2636 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 17156 event pairs, 1018 based on Foata normal form. 4/1982 useless extension candidates. Maximal degree in co-relation 4709. Up to 1846 conditions per place. [2025-03-09 06:44:14,700 INFO L140 encePairwiseOnDemand]: 84/105 looper letters, 75 selfloop transitions, 32 changer transitions 1/133 dead transitions. [2025-03-09 06:44:14,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 133 transitions, 846 flow [2025-03-09 06:44:14,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 06:44:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 06:44:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 623 transitions. [2025-03-09 06:44:14,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34901960784313724 [2025-03-09 06:44:14,702 INFO L175 Difference]: Start difference. First operand has 126 places, 128 transitions, 608 flow. Second operand 17 states and 623 transitions. [2025-03-09 06:44:14,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 133 transitions, 846 flow [2025-03-09 06:44:14,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 133 transitions, 824 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 06:44:14,705 INFO L231 Difference]: Finished difference. Result has 140 places, 131 transitions, 679 flow [2025-03-09 06:44:14,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=679, PETRI_PLACES=140, PETRI_TRANSITIONS=131} [2025-03-09 06:44:14,706 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 40 predicate places. [2025-03-09 06:44:14,706 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 131 transitions, 679 flow [2025-03-09 06:44:14,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 33.6) internal successors, (672), 20 states have internal predecessors, (672), 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-09 06:44:14,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:14,706 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:14,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 06:44:14,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:14,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:14,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:14,908 INFO L85 PathProgramCache]: Analyzing trace with hash 535696082, now seen corresponding path program 1 times [2025-03-09 06:44:14,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:14,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321865360] [2025-03-09 06:44:14,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:14,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:14,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:44:14,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:44:14,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:14,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 06:44:15,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:15,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321865360] [2025-03-09 06:44:15,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321865360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:15,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232823638] [2025-03-09 06:44:15,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:15,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:15,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:15,009 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-09 06:44:15,011 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-09 06:44:15,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:44:15,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:44:15,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:15,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:15,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:44:15,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 06:44:15,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 06:44:15,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232823638] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:15,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:15,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-03-09 06:44:15,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693873843] [2025-03-09 06:44:15,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:15,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 06:44:15,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:15,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 06:44:15,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-03-09 06:44:15,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-09 06:44:15,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 131 transitions, 679 flow. Second operand has 21 states, 21 states have (on average 49.285714285714285) internal successors, (1035), 21 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:15,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:15,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-09 06:44:15,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:16,005 INFO L124 PetriNetUnfolderBase]: 2743/5220 cut-off events. [2025-03-09 06:44:16,006 INFO L125 PetriNetUnfolderBase]: For 381/381 co-relation queries the response was YES. [2025-03-09 06:44:16,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9361 conditions, 5220 events. 2743/5220 cut-off events. For 381/381 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 36021 event pairs, 2036 based on Foata normal form. 2/3938 useless extension candidates. Maximal degree in co-relation 9310. Up to 1863 conditions per place. [2025-03-09 06:44:16,023 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 93 selfloop transitions, 46 changer transitions 0/181 dead transitions. [2025-03-09 06:44:16,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 181 transitions, 1184 flow [2025-03-09 06:44:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:44:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 06:44:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 639 transitions. [2025-03-09 06:44:16,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5532467532467532 [2025-03-09 06:44:16,025 INFO L175 Difference]: Start difference. First operand has 140 places, 131 transitions, 679 flow. Second operand 11 states and 639 transitions. [2025-03-09 06:44:16,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 181 transitions, 1184 flow [2025-03-09 06:44:16,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 181 transitions, 1118 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-03-09 06:44:16,030 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 774 flow [2025-03-09 06:44:16,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=774, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2025-03-09 06:44:16,031 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 41 predicate places. [2025-03-09 06:44:16,031 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 774 flow [2025-03-09 06:44:16,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 49.285714285714285) internal successors, (1035), 21 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:16,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:16,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:16,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 06:44:16,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 06:44:16,235 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:16,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:16,235 INFO L85 PathProgramCache]: Analyzing trace with hash 574936650, now seen corresponding path program 1 times [2025-03-09 06:44:16,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:16,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160945964] [2025-03-09 06:44:16,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:16,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:16,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:44:16,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:44:16,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:16,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:44:16,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:16,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160945964] [2025-03-09 06:44:16,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160945964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:44:16,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:44:16,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:44:16,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264852156] [2025-03-09 06:44:16,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:44:16,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:44:16,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:16,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:44:16,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:44:16,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 105 [2025-03-09 06:44:16,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 774 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:16,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:16,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 105 [2025-03-09 06:44:16,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:16,780 INFO L124 PetriNetUnfolderBase]: 2743/5208 cut-off events. [2025-03-09 06:44:16,781 INFO L125 PetriNetUnfolderBase]: For 359/359 co-relation queries the response was YES. [2025-03-09 06:44:16,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9378 conditions, 5208 events. 2743/5208 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 36221 event pairs, 2036 based on Foata normal form. 2/3900 useless extension candidates. Maximal degree in co-relation 9327. Up to 3731 conditions per place. [2025-03-09 06:44:16,803 INFO L140 encePairwiseOnDemand]: 91/105 looper letters, 88 selfloop transitions, 20 changer transitions 0/139 dead transitions. [2025-03-09 06:44:16,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 139 transitions, 994 flow [2025-03-09 06:44:16,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:44:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:44:16,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 298 transitions. [2025-03-09 06:44:16,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.473015873015873 [2025-03-09 06:44:16,807 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 774 flow. Second operand 6 states and 298 transitions. [2025-03-09 06:44:16,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 139 transitions, 994 flow [2025-03-09 06:44:16,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 139 transitions, 913 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-09 06:44:16,810 INFO L231 Difference]: Finished difference. Result has 140 places, 139 transitions, 763 flow [2025-03-09 06:44:16,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=763, PETRI_PLACES=140, PETRI_TRANSITIONS=139} [2025-03-09 06:44:16,811 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 40 predicate places. [2025-03-09 06:44:16,811 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 139 transitions, 763 flow [2025-03-09 06:44:16,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:16,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:16,811 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1] [2025-03-09 06:44:16,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:44:16,811 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:16,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:16,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1040732735, now seen corresponding path program 2 times [2025-03-09 06:44:16,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:16,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737200717] [2025-03-09 06:44:16,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:44:16,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:16,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 06:44:16,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-03-09 06:44:16,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:44:16,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-09 06:44:16,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:16,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737200717] [2025-03-09 06:44:16,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737200717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:16,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879602694] [2025-03-09 06:44:16,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:44:16,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:16,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:16,846 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-09 06:44:16,847 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-09 06:44:16,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 06:44:16,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-03-09 06:44:16,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:44:16,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:16,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:44:16,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-09 06:44:16,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-09 06:44:16,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879602694] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:16,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:16,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-09 06:44:16,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596378547] [2025-03-09 06:44:16,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:16,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:44:16,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:16,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:44:16,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:44:16,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-09 06:44:16,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 139 transitions, 763 flow. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:16,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:16,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-09 06:44:16,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:17,343 INFO L124 PetriNetUnfolderBase]: 2745/5206 cut-off events. [2025-03-09 06:44:17,343 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2025-03-09 06:44:17,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9350 conditions, 5206 events. 2745/5206 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 36185 event pairs, 2036 based on Foata normal form. 2/3898 useless extension candidates. Maximal degree in co-relation 9298. Up to 3699 conditions per place. [2025-03-09 06:44:17,362 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 55 selfloop transitions, 40 changer transitions 0/137 dead transitions. [2025-03-09 06:44:17,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 137 transitions, 933 flow [2025-03-09 06:44:17,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:44:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:44:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 290 transitions. [2025-03-09 06:44:17,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-03-09 06:44:17,363 INFO L175 Difference]: Start difference. First operand has 140 places, 139 transitions, 763 flow. Second operand 5 states and 290 transitions. [2025-03-09 06:44:17,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 137 transitions, 933 flow [2025-03-09 06:44:17,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 137 transitions, 873 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-09 06:44:17,367 INFO L231 Difference]: Finished difference. Result has 134 places, 137 transitions, 763 flow [2025-03-09 06:44:17,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=763, PETRI_PLACES=134, PETRI_TRANSITIONS=137} [2025-03-09 06:44:17,367 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 34 predicate places. [2025-03-09 06:44:17,368 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 137 transitions, 763 flow [2025-03-09 06:44:17,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:17,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:17,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:17,374 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-09 06:44:17,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 06:44:17,569 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:17,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:17,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1186625962, now seen corresponding path program 1 times [2025-03-09 06:44:17,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:17,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494111450] [2025-03-09 06:44:17,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:17,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:17,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 06:44:17,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 06:44:17,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:17,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:44:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:17,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494111450] [2025-03-09 06:44:17,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494111450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:44:17,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:44:17,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:44:17,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357854686] [2025-03-09 06:44:17,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:44:17,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:44:17,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:17,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:44:17,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:44:17,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 105 [2025-03-09 06:44:17,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 137 transitions, 763 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:17,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:17,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 105 [2025-03-09 06:44:17,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:18,197 INFO L124 PetriNetUnfolderBase]: 5665/9778 cut-off events. [2025-03-09 06:44:18,197 INFO L125 PetriNetUnfolderBase]: For 342/342 co-relation queries the response was YES. [2025-03-09 06:44:18,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17861 conditions, 9778 events. 5665/9778 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 70333 event pairs, 3132 based on Foata normal form. 284/7382 useless extension candidates. Maximal degree in co-relation 17816. Up to 5784 conditions per place. [2025-03-09 06:44:18,230 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 136 selfloop transitions, 4 changer transitions 0/180 dead transitions. [2025-03-09 06:44:18,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 180 transitions, 1133 flow [2025-03-09 06:44:18,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:44:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:44:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 303 transitions. [2025-03-09 06:44:18,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7214285714285714 [2025-03-09 06:44:18,231 INFO L175 Difference]: Start difference. First operand has 134 places, 137 transitions, 763 flow. Second operand 4 states and 303 transitions. [2025-03-09 06:44:18,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 180 transitions, 1133 flow [2025-03-09 06:44:18,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 180 transitions, 1058 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:44:18,234 INFO L231 Difference]: Finished difference. Result has 136 places, 140 transitions, 717 flow [2025-03-09 06:44:18,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=717, PETRI_PLACES=136, PETRI_TRANSITIONS=140} [2025-03-09 06:44:18,235 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 36 predicate places. [2025-03-09 06:44:18,235 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 140 transitions, 717 flow [2025-03-09 06:44:18,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:18,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:18,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:18,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 06:44:18,236 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:18,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:18,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2137068283, now seen corresponding path program 1 times [2025-03-09 06:44:18,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:18,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833185032] [2025-03-09 06:44:18,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:18,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:18,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 06:44:18,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 06:44:18,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:18,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:44:18,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:18,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833185032] [2025-03-09 06:44:18,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833185032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:18,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651505120] [2025-03-09 06:44:18,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:18,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:18,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:18,315 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:44:18,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 06:44:18,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 06:44:18,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 06:44:18,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:18,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:18,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:44:18,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:44:18,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:44:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651505120] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:18,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 06:44:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121036327] [2025-03-09 06:44:18,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:18,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 06:44:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:18,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 06:44:18,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:44:18,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 105 [2025-03-09 06:44:18,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 140 transitions, 717 flow. Second operand has 15 states, 15 states have (on average 49.06666666666667) internal successors, (736), 15 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:18,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:18,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 105 [2025-03-09 06:44:18,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:19,190 INFO L124 PetriNetUnfolderBase]: 2982/5218 cut-off events. [2025-03-09 06:44:19,190 INFO L125 PetriNetUnfolderBase]: For 2146/2435 co-relation queries the response was YES. [2025-03-09 06:44:19,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11613 conditions, 5218 events. 2982/5218 cut-off events. For 2146/2435 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 32148 event pairs, 2064 based on Foata normal form. 0/4154 useless extension candidates. Maximal degree in co-relation 11566. Up to 3246 conditions per place. [2025-03-09 06:44:19,214 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 111 selfloop transitions, 45 changer transitions 0/197 dead transitions. [2025-03-09 06:44:19,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 197 transitions, 1254 flow [2025-03-09 06:44:19,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:44:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 06:44:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 631 transitions. [2025-03-09 06:44:19,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5463203463203463 [2025-03-09 06:44:19,216 INFO L175 Difference]: Start difference. First operand has 136 places, 140 transitions, 717 flow. Second operand 11 states and 631 transitions. [2025-03-09 06:44:19,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 197 transitions, 1254 flow [2025-03-09 06:44:19,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 197 transitions, 1245 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:44:19,222 INFO L231 Difference]: Finished difference. Result has 147 places, 142 transitions, 820 flow [2025-03-09 06:44:19,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=820, PETRI_PLACES=147, PETRI_TRANSITIONS=142} [2025-03-09 06:44:19,223 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 47 predicate places. [2025-03-09 06:44:19,223 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 142 transitions, 820 flow [2025-03-09 06:44:19,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 49.06666666666667) internal successors, (736), 15 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:19,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:19,224 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:19,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 06:44:19,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 06:44:19,424 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:19,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:19,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1100898770, now seen corresponding path program 1 times [2025-03-09 06:44:19,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:19,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015780473] [2025-03-09 06:44:19,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:19,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:19,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 06:44:19,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:44:19,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:19,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:44:19,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:19,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015780473] [2025-03-09 06:44:19,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015780473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:19,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350650714] [2025-03-09 06:44:19,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:19,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:19,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:19,515 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:44:19,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 06:44:19,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 06:44:19,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 06:44:19,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:19,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:19,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:44:19,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:44:19,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:44:19,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350650714] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:19,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:19,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 06:44:19,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491527403] [2025-03-09 06:44:19,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:19,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 06:44:19,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:19,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 06:44:19,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:44:19,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-09 06:44:19,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 142 transitions, 820 flow. Second operand has 15 states, 15 states have (on average 50.0) internal successors, (750), 15 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:19,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:19,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-09 06:44:19,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:20,191 INFO L124 PetriNetUnfolderBase]: 2378/4508 cut-off events. [2025-03-09 06:44:20,191 INFO L125 PetriNetUnfolderBase]: For 1746/1954 co-relation queries the response was YES. [2025-03-09 06:44:20,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9604 conditions, 4508 events. 2378/4508 cut-off events. For 1746/1954 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 31264 event pairs, 1672 based on Foata normal form. 44/3656 useless extension candidates. Maximal degree in co-relation 9555. Up to 2813 conditions per place. [2025-03-09 06:44:20,205 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 101 selfloop transitions, 45 changer transitions 0/188 dead transitions. [2025-03-09 06:44:20,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 188 transitions, 1289 flow [2025-03-09 06:44:20,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:44:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 06:44:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 638 transitions. [2025-03-09 06:44:20,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-03-09 06:44:20,206 INFO L175 Difference]: Start difference. First operand has 147 places, 142 transitions, 820 flow. Second operand 11 states and 638 transitions. [2025-03-09 06:44:20,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 188 transitions, 1289 flow [2025-03-09 06:44:20,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 188 transitions, 1205 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 06:44:20,212 INFO L231 Difference]: Finished difference. Result has 151 places, 144 transitions, 846 flow [2025-03-09 06:44:20,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=846, PETRI_PLACES=151, PETRI_TRANSITIONS=144} [2025-03-09 06:44:20,212 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 51 predicate places. [2025-03-09 06:44:20,212 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 846 flow [2025-03-09 06:44:20,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 50.0) internal successors, (750), 15 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:20,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:20,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:20,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 06:44:20,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 06:44:20,413 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:20,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:20,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1320083278, now seen corresponding path program 1 times [2025-03-09 06:44:20,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:20,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559469612] [2025-03-09 06:44:20,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:20,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:20,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:44:20,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:44:20,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:20,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:44:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:20,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559469612] [2025-03-09 06:44:20,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559469612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:44:20,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:44:20,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:44:20,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744499820] [2025-03-09 06:44:20,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:44:20,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:44:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:20,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:44:20,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:44:20,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 105 [2025-03-09 06:44:20,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 846 flow. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:20,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:20,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 105 [2025-03-09 06:44:20,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:21,076 INFO L124 PetriNetUnfolderBase]: 5436/9302 cut-off events. [2025-03-09 06:44:21,077 INFO L125 PetriNetUnfolderBase]: For 6467/6812 co-relation queries the response was YES. [2025-03-09 06:44:21,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21941 conditions, 9302 events. 5436/9302 cut-off events. For 6467/6812 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 63326 event pairs, 2711 based on Foata normal form. 153/7629 useless extension candidates. Maximal degree in co-relation 21856. Up to 4812 conditions per place. [2025-03-09 06:44:21,116 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 164 selfloop transitions, 3 changer transitions 0/206 dead transitions. [2025-03-09 06:44:21,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 206 transitions, 1423 flow [2025-03-09 06:44:21,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:44:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:44:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 302 transitions. [2025-03-09 06:44:21,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.719047619047619 [2025-03-09 06:44:21,117 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 846 flow. Second operand 4 states and 302 transitions. [2025-03-09 06:44:21,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 206 transitions, 1423 flow [2025-03-09 06:44:21,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 206 transitions, 1339 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 06:44:21,127 INFO L231 Difference]: Finished difference. Result has 148 places, 146 transitions, 784 flow [2025-03-09 06:44:21,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=784, PETRI_PLACES=148, PETRI_TRANSITIONS=146} [2025-03-09 06:44:21,127 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 48 predicate places. [2025-03-09 06:44:21,127 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 146 transitions, 784 flow [2025-03-09 06:44:21,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:21,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:21,127 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:21,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 06:44:21,128 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:21,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:21,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1391112247, now seen corresponding path program 2 times [2025-03-09 06:44:21,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:21,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262822482] [2025-03-09 06:44:21,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:44:21,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:21,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-09 06:44:21,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:44:21,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:44:21,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 06:44:21,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:21,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262822482] [2025-03-09 06:44:21,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262822482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:21,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458304558] [2025-03-09 06:44:21,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:44:21,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:21,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:21,466 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:44:21,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 06:44:21,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-09 06:44:21,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:44:21,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:44:21,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:21,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 06:44:21,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:21,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:44:21,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 06:44:21,618 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:44:21,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:44:21,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-09 06:44:21,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-09 06:44:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 06:44:21,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:21,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:21,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-09 06:44:21,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:21,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2025-03-09 06:44:21,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-09 06:44:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 06:44:21,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458304558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:21,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:21,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2025-03-09 06:44:21,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616603497] [2025-03-09 06:44:21,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:21,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 06:44:21,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:21,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 06:44:21,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=473, Unknown=3, NotChecked=0, Total=552 [2025-03-09 06:44:22,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-03-09 06:44:22,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 146 transitions, 784 flow. Second operand has 24 states, 24 states have (on average 46.208333333333336) internal successors, (1109), 24 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:22,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:22,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-03-09 06:44:22,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:23,576 INFO L124 PetriNetUnfolderBase]: 7277/11637 cut-off events. [2025-03-09 06:44:23,576 INFO L125 PetriNetUnfolderBase]: For 9814/11083 co-relation queries the response was YES. [2025-03-09 06:44:23,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30031 conditions, 11637 events. 7277/11637 cut-off events. For 9814/11083 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 75444 event pairs, 1863 based on Foata normal form. 245/9673 useless extension candidates. Maximal degree in co-relation 29910. Up to 3441 conditions per place. [2025-03-09 06:44:23,624 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 170 selfloop transitions, 43 changer transitions 0/251 dead transitions. [2025-03-09 06:44:23,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 251 transitions, 1631 flow [2025-03-09 06:44:23,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 06:44:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-09 06:44:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 844 transitions. [2025-03-09 06:44:23,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5023809523809524 [2025-03-09 06:44:23,626 INFO L175 Difference]: Start difference. First operand has 148 places, 146 transitions, 784 flow. Second operand 16 states and 844 transitions. [2025-03-09 06:44:23,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 251 transitions, 1631 flow [2025-03-09 06:44:23,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 251 transitions, 1621 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:44:23,635 INFO L231 Difference]: Finished difference. Result has 164 places, 154 transitions, 931 flow [2025-03-09 06:44:23,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=931, PETRI_PLACES=164, PETRI_TRANSITIONS=154} [2025-03-09 06:44:23,636 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 64 predicate places. [2025-03-09 06:44:23,636 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 154 transitions, 931 flow [2025-03-09 06:44:23,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 46.208333333333336) internal successors, (1109), 24 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:23,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:23,637 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:23,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 06:44:23,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:23,841 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:23,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:23,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1391112246, now seen corresponding path program 1 times [2025-03-09 06:44:23,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:23,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231309061] [2025-03-09 06:44:23,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:23,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:23,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 06:44:23,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:44:23,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:23,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:44:24,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:24,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231309061] [2025-03-09 06:44:24,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231309061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:24,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899605285] [2025-03-09 06:44:24,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:24,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:24,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:24,370 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:44:24,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 06:44:24,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 06:44:24,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:44:24,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:24,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:24,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:44:24,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:24,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:44:24,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 06:44:24,534 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:44:24,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:44:24,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 06:44:24,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 06:44:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 06:44:24,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:24,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:24,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-03-09 06:44:24,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:24,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2025-03-09 06:44:24,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:44:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 06:44:24,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899605285] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:24,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:24,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 27 [2025-03-09 06:44:24,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459475244] [2025-03-09 06:44:24,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:24,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 06:44:24,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:24,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 06:44:24,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=664, Unknown=5, NotChecked=0, Total=756 [2025-03-09 06:44:25,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-09 06:44:25,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 154 transitions, 931 flow. Second operand has 28 states, 28 states have (on average 44.964285714285715) internal successors, (1259), 28 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:25,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:25,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-09 06:44:25,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:26,564 INFO L124 PetriNetUnfolderBase]: 7964/12739 cut-off events. [2025-03-09 06:44:26,565 INFO L125 PetriNetUnfolderBase]: For 12076/13219 co-relation queries the response was YES. [2025-03-09 06:44:26,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35549 conditions, 12739 events. 7964/12739 cut-off events. For 12076/13219 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 81283 event pairs, 1997 based on Foata normal form. 174/10410 useless extension candidates. Maximal degree in co-relation 35460. Up to 3885 conditions per place. [2025-03-09 06:44:26,626 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 153 selfloop transitions, 39 changer transitions 0/229 dead transitions. [2025-03-09 06:44:26,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 229 transitions, 1560 flow [2025-03-09 06:44:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 06:44:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-09 06:44:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 946 transitions. [2025-03-09 06:44:26,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4741854636591479 [2025-03-09 06:44:26,627 INFO L175 Difference]: Start difference. First operand has 164 places, 154 transitions, 931 flow. Second operand 19 states and 946 transitions. [2025-03-09 06:44:26,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 229 transitions, 1560 flow [2025-03-09 06:44:26,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 229 transitions, 1525 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-09 06:44:26,643 INFO L231 Difference]: Finished difference. Result has 177 places, 149 transitions, 920 flow [2025-03-09 06:44:26,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=920, PETRI_PLACES=177, PETRI_TRANSITIONS=149} [2025-03-09 06:44:26,643 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 77 predicate places. [2025-03-09 06:44:26,643 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 149 transitions, 920 flow [2025-03-09 06:44:26,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 44.964285714285715) internal successors, (1259), 28 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:26,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:26,644 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:26,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 06:44:26,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-09 06:44:26,848 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:26,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:26,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1391112243, now seen corresponding path program 1 times [2025-03-09 06:44:26,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:26,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86257199] [2025-03-09 06:44:26,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:26,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:26,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 06:44:26,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:44:26,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:26,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:44:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:27,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86257199] [2025-03-09 06:44:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86257199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:27,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934774256] [2025-03-09 06:44:27,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:27,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:27,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:27,206 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:44:27,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 06:44:27,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 06:44:27,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:44:27,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:27,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:27,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-09 06:44:27,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:27,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:44:27,337 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-09 06:44:27,359 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:44:27,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:44:27,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 06:44:27,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 06:44:27,412 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 06:44:27,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-09 06:44:27,470 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-09 06:44:27,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-03-09 06:44:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:44:27,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:27,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:27,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-03-09 06:44:27,663 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_7 (Array Int Int))) (or (< 2147483647 (select v_arrayElimArr_7 4)) (< (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_7) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648))) is different from false [2025-03-09 06:44:27,676 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_203| Int)) (or (< 2147483647 (select v_arrayElimArr_7 4)) (< (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_458) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_203| v_arrayElimArr_7) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483648))) is different from false [2025-03-09 06:44:27,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:27,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-03-09 06:44:27,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:27,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 129 [2025-03-09 06:44:27,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2025-03-09 06:44:27,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:27,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2025-03-09 06:44:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-09 06:44:27,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934774256] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:27,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:27,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 23 [2025-03-09 06:44:27,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32128072] [2025-03-09 06:44:27,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:27,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 06:44:27,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:27,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 06:44:27,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=416, Unknown=16, NotChecked=86, Total=600 [2025-03-09 06:44:27,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-03-09 06:44:27,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 149 transitions, 920 flow. Second operand has 25 states, 25 states have (on average 45.96) internal successors, (1149), 25 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:27,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:27,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-03-09 06:44:27,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:29,320 INFO L124 PetriNetUnfolderBase]: 6302/10386 cut-off events. [2025-03-09 06:44:29,320 INFO L125 PetriNetUnfolderBase]: For 10394/11314 co-relation queries the response was YES. [2025-03-09 06:44:29,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29763 conditions, 10386 events. 6302/10386 cut-off events. For 10394/11314 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 67728 event pairs, 3317 based on Foata normal form. 159/9122 useless extension candidates. Maximal degree in co-relation 29675. Up to 5276 conditions per place. [2025-03-09 06:44:29,374 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 154 selfloop transitions, 33 changer transitions 0/225 dead transitions. [2025-03-09 06:44:29,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 225 transitions, 1583 flow [2025-03-09 06:44:29,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 06:44:29,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 06:44:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 786 transitions. [2025-03-09 06:44:29,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4990476190476191 [2025-03-09 06:44:29,376 INFO L175 Difference]: Start difference. First operand has 177 places, 149 transitions, 920 flow. Second operand 15 states and 786 transitions. [2025-03-09 06:44:29,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 225 transitions, 1583 flow [2025-03-09 06:44:29,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 225 transitions, 1488 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-09 06:44:29,389 INFO L231 Difference]: Finished difference. Result has 173 places, 148 transitions, 887 flow [2025-03-09 06:44:29,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=887, PETRI_PLACES=173, PETRI_TRANSITIONS=148} [2025-03-09 06:44:29,390 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 73 predicate places. [2025-03-09 06:44:29,390 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 148 transitions, 887 flow [2025-03-09 06:44:29,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 45.96) internal successors, (1149), 25 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:29,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:29,391 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:29,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 06:44:29,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:29,592 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:29,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1391112244, now seen corresponding path program 1 times [2025-03-09 06:44:29,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:29,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572850689] [2025-03-09 06:44:29,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:29,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:29,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 06:44:29,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:44:29,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:29,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:44:30,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:30,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572850689] [2025-03-09 06:44:30,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572850689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:30,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956352187] [2025-03-09 06:44:30,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:30,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:30,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:30,008 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:44:30,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 06:44:30,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 06:44:30,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:44:30,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:30,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:30,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-09 06:44:30,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:30,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 06:44:30,162 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-09 06:44:30,194 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 06:44:30,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 06:44:30,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 06:44:30,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-09 06:44:30,253 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 06:44:30,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-03-09 06:44:30,323 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-09 06:44:30,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-09 06:44:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:44:30,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:30,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:30,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2025-03-09 06:44:30,513 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (or (< (+ (select v_arrayElimArr_9 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648) 0) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_9) c_~A~0.base) (+ c_~A~0.offset 4)))))) is different from false [2025-03-09 06:44:30,519 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (or (< (+ (select v_arrayElimArr_9 4) 2147483648) 0) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_9) c_~A~0.base) (+ c_~A~0.offset 4)))))) is different from false [2025-03-09 06:44:30,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_207| Int) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (or (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_500) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_207| v_arrayElimArr_9) c_~A~0.base) (+ c_~A~0.offset 4)))) (< (+ (select v_arrayElimArr_9 4) 2147483648) 0))) is different from false [2025-03-09 06:44:30,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:30,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-03-09 06:44:30,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:30,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 75 [2025-03-09 06:44:30,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:44:30,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 67 [2025-03-09 06:44:30,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-03-09 06:44:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-09 06:44:30,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956352187] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:30,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:30,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 27 [2025-03-09 06:44:30,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041864992] [2025-03-09 06:44:30,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:30,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 06:44:30,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:30,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 06:44:30,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=562, Unknown=3, NotChecked=150, Total=812 [2025-03-09 06:44:30,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2025-03-09 06:44:30,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 148 transitions, 887 flow. Second operand has 29 states, 29 states have (on average 45.827586206896555) internal successors, (1329), 29 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:30,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:30,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2025-03-09 06:44:30,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:32,024 INFO L124 PetriNetUnfolderBase]: 5970/9906 cut-off events. [2025-03-09 06:44:32,025 INFO L125 PetriNetUnfolderBase]: For 10634/11475 co-relation queries the response was YES. [2025-03-09 06:44:32,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28026 conditions, 9906 events. 5970/9906 cut-off events. For 10634/11475 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 64314 event pairs, 3147 based on Foata normal form. 146/8910 useless extension candidates. Maximal degree in co-relation 27938. Up to 5276 conditions per place. [2025-03-09 06:44:32,073 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 153 selfloop transitions, 33 changer transitions 0/224 dead transitions. [2025-03-09 06:44:32,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 224 transitions, 1548 flow [2025-03-09 06:44:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 06:44:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 06:44:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 785 transitions. [2025-03-09 06:44:32,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4984126984126984 [2025-03-09 06:44:32,075 INFO L175 Difference]: Start difference. First operand has 173 places, 148 transitions, 887 flow. Second operand 15 states and 785 transitions. [2025-03-09 06:44:32,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 224 transitions, 1548 flow [2025-03-09 06:44:32,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 224 transitions, 1489 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-03-09 06:44:32,086 INFO L231 Difference]: Finished difference. Result has 177 places, 147 transitions, 890 flow [2025-03-09 06:44:32,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=890, PETRI_PLACES=177, PETRI_TRANSITIONS=147} [2025-03-09 06:44:32,087 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 77 predicate places. [2025-03-09 06:44:32,087 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 147 transitions, 890 flow [2025-03-09 06:44:32,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 45.827586206896555) internal successors, (1329), 29 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:32,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:32,088 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:32,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 06:44:32,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:32,288 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:32,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:32,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1194654496, now seen corresponding path program 2 times [2025-03-09 06:44:32,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:32,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387956069] [2025-03-09 06:44:32,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:44:32,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:32,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-09 06:44:32,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 06:44:32,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:44:32,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:44:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:32,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387956069] [2025-03-09 06:44:32,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387956069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:44:32,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:44:32,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:44:32,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674862877] [2025-03-09 06:44:32,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:44:32,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:44:32,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:32,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:44:32,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:44:32,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 105 [2025-03-09 06:44:32,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 147 transitions, 890 flow. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:32,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:32,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 105 [2025-03-09 06:44:32,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:33,185 INFO L124 PetriNetUnfolderBase]: 6392/10098 cut-off events. [2025-03-09 06:44:33,185 INFO L125 PetriNetUnfolderBase]: For 10891/11669 co-relation queries the response was YES. [2025-03-09 06:44:33,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30119 conditions, 10098 events. 6392/10098 cut-off events. For 10891/11669 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 63889 event pairs, 1509 based on Foata normal form. 459/9262 useless extension candidates. Maximal degree in co-relation 30031. Up to 4260 conditions per place. [2025-03-09 06:44:33,245 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 147 selfloop transitions, 9 changer transitions 0/196 dead transitions. [2025-03-09 06:44:33,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 196 transitions, 1444 flow [2025-03-09 06:44:33,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:44:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:44:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2025-03-09 06:44:33,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2025-03-09 06:44:33,246 INFO L175 Difference]: Start difference. First operand has 177 places, 147 transitions, 890 flow. Second operand 4 states and 295 transitions. [2025-03-09 06:44:33,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 196 transitions, 1444 flow [2025-03-09 06:44:33,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 196 transitions, 1365 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-03-09 06:44:33,265 INFO L231 Difference]: Finished difference. Result has 166 places, 146 transitions, 839 flow [2025-03-09 06:44:33,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=839, PETRI_PLACES=166, PETRI_TRANSITIONS=146} [2025-03-09 06:44:33,266 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 66 predicate places. [2025-03-09 06:44:33,266 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 146 transitions, 839 flow [2025-03-09 06:44:33,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:33,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:33,266 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:33,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 06:44:33,266 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:33,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:33,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1124003822, now seen corresponding path program 1 times [2025-03-09 06:44:33,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:33,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895438238] [2025-03-09 06:44:33,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:33,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:44:33,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:44:33,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:33,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:44:33,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:33,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895438238] [2025-03-09 06:44:33,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895438238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:44:33,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:44:33,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:44:33,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192589919] [2025-03-09 06:44:33,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:44:33,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:44:33,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:33,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:44:33,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:44:33,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 105 [2025-03-09 06:44:33,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 146 transitions, 839 flow. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:33,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:33,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 105 [2025-03-09 06:44:33,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:33,982 INFO L124 PetriNetUnfolderBase]: 5890/9478 cut-off events. [2025-03-09 06:44:33,982 INFO L125 PetriNetUnfolderBase]: For 14761/15441 co-relation queries the response was YES. [2025-03-09 06:44:34,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29634 conditions, 9478 events. 5890/9478 cut-off events. For 14761/15441 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 59655 event pairs, 3737 based on Foata normal form. 455/9028 useless extension candidates. Maximal degree in co-relation 29546. Up to 6659 conditions per place. [2025-03-09 06:44:34,029 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 138 selfloop transitions, 6 changer transitions 0/183 dead transitions. [2025-03-09 06:44:34,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 183 transitions, 1305 flow [2025-03-09 06:44:34,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:44:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:44:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 287 transitions. [2025-03-09 06:44:34,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-09 06:44:34,030 INFO L175 Difference]: Start difference. First operand has 166 places, 146 transitions, 839 flow. Second operand 4 states and 287 transitions. [2025-03-09 06:44:34,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 183 transitions, 1305 flow [2025-03-09 06:44:34,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 183 transitions, 1255 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:44:34,041 INFO L231 Difference]: Finished difference. Result has 168 places, 147 transitions, 848 flow [2025-03-09 06:44:34,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=848, PETRI_PLACES=168, PETRI_TRANSITIONS=147} [2025-03-09 06:44:34,041 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 68 predicate places. [2025-03-09 06:44:34,041 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 147 transitions, 848 flow [2025-03-09 06:44:34,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:34,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:34,041 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:34,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 06:44:34,041 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:34,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:34,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1620415403, now seen corresponding path program 1 times [2025-03-09 06:44:34,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:34,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224489211] [2025-03-09 06:44:34,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:34,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:34,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:44:34,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:44:34,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:34,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 06:44:34,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:34,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224489211] [2025-03-09 06:44:34,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224489211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:34,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475740765] [2025-03-09 06:44:34,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:34,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:34,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:34,089 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:44:34,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 06:44:34,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 06:44:34,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 06:44:34,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:34,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:34,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:44:34,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 06:44:34,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 06:44:34,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475740765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:34,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:34,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 23 [2025-03-09 06:44:34,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349807109] [2025-03-09 06:44:34,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:34,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 06:44:34,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:34,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 06:44:34,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-03-09 06:44:34,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 105 [2025-03-09 06:44:34,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 147 transitions, 848 flow. Second operand has 23 states, 23 states have (on average 48.17391304347826) internal successors, (1108), 23 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:34,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:34,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 105 [2025-03-09 06:44:34,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:36,129 INFO L124 PetriNetUnfolderBase]: 9996/16304 cut-off events. [2025-03-09 06:44:36,129 INFO L125 PetriNetUnfolderBase]: For 20139/21363 co-relation queries the response was YES. [2025-03-09 06:44:36,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49772 conditions, 16304 events. 9996/16304 cut-off events. For 20139/21363 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 110996 event pairs, 3629 based on Foata normal form. 288/14482 useless extension candidates. Maximal degree in co-relation 49648. Up to 4652 conditions per place. [2025-03-09 06:44:36,226 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 285 selfloop transitions, 70 changer transitions 0/397 dead transitions. [2025-03-09 06:44:36,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 397 transitions, 2906 flow [2025-03-09 06:44:36,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 06:44:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 06:44:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1246 transitions. [2025-03-09 06:44:36,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5650793650793651 [2025-03-09 06:44:36,228 INFO L175 Difference]: Start difference. First operand has 168 places, 147 transitions, 848 flow. Second operand 21 states and 1246 transitions. [2025-03-09 06:44:36,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 397 transitions, 2906 flow [2025-03-09 06:44:36,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 397 transitions, 2875 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:44:36,272 INFO L231 Difference]: Finished difference. Result has 192 places, 177 transitions, 1265 flow [2025-03-09 06:44:36,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1265, PETRI_PLACES=192, PETRI_TRANSITIONS=177} [2025-03-09 06:44:36,272 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 92 predicate places. [2025-03-09 06:44:36,273 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 177 transitions, 1265 flow [2025-03-09 06:44:36,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 48.17391304347826) internal successors, (1108), 23 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:36,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:36,273 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:36,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-09 06:44:36,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 06:44:36,474 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:36,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:36,474 INFO L85 PathProgramCache]: Analyzing trace with hash -355097955, now seen corresponding path program 1 times [2025-03-09 06:44:36,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:36,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983301910] [2025-03-09 06:44:36,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:36,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:36,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 06:44:36,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:44:36,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:36,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:44:36,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:36,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983301910] [2025-03-09 06:44:36,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983301910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:44:36,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:44:36,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:44:36,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503740675] [2025-03-09 06:44:36,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:44:36,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:44:36,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:36,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:44:36,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:44:36,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-03-09 06:44:36,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 177 transitions, 1265 flow. Second operand has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 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-09 06:44:36,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:36,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-03-09 06:44:36,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:38,643 INFO L124 PetriNetUnfolderBase]: 13287/21927 cut-off events. [2025-03-09 06:44:38,643 INFO L125 PetriNetUnfolderBase]: For 38996/40656 co-relation queries the response was YES. [2025-03-09 06:44:38,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74647 conditions, 21927 events. 13287/21927 cut-off events. For 38996/40656 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 159281 event pairs, 5618 based on Foata normal form. 448/20567 useless extension candidates. Maximal degree in co-relation 74511. Up to 13387 conditions per place. [2025-03-09 06:44:38,759 INFO L140 encePairwiseOnDemand]: 94/105 looper letters, 165 selfloop transitions, 16 changer transitions 0/219 dead transitions. [2025-03-09 06:44:38,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 219 transitions, 1861 flow [2025-03-09 06:44:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:44:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:44:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 309 transitions. [2025-03-09 06:44:38,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5885714285714285 [2025-03-09 06:44:38,760 INFO L175 Difference]: Start difference. First operand has 192 places, 177 transitions, 1265 flow. Second operand 5 states and 309 transitions. [2025-03-09 06:44:38,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 219 transitions, 1861 flow [2025-03-09 06:44:39,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 219 transitions, 1808 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-09 06:44:39,105 INFO L231 Difference]: Finished difference. Result has 195 places, 181 transitions, 1315 flow [2025-03-09 06:44:39,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1315, PETRI_PLACES=195, PETRI_TRANSITIONS=181} [2025-03-09 06:44:39,106 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 95 predicate places. [2025-03-09 06:44:39,106 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 181 transitions, 1315 flow [2025-03-09 06:44:39,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.166666666666664) internal successors, (295), 6 states have internal predecessors, (295), 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-09 06:44:39,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:39,106 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:39,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 06:44:39,106 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:39,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:39,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1631924389, now seen corresponding path program 1 times [2025-03-09 06:44:39,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:39,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889372878] [2025-03-09 06:44:39,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:39,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:39,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 06:44:39,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:44:39,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:39,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 06:44:39,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:39,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889372878] [2025-03-09 06:44:39,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889372878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:39,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005650204] [2025-03-09 06:44:39,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:39,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:39,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:39,235 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:44:39,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 06:44:39,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 06:44:39,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:44:39,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:39,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:39,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 06:44:39,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 06:44:39,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 06:44:39,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005650204] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:39,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:39,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-09 06:44:39,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419803150] [2025-03-09 06:44:39,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:39,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 06:44:39,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:39,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 06:44:39,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2025-03-09 06:44:39,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-03-09 06:44:39,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 181 transitions, 1315 flow. Second operand has 26 states, 26 states have (on average 45.84615384615385) internal successors, (1192), 26 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:39,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:39,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-03-09 06:44:39,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:42,127 INFO L124 PetriNetUnfolderBase]: 16357/26332 cut-off events. [2025-03-09 06:44:42,127 INFO L125 PetriNetUnfolderBase]: For 41698/42958 co-relation queries the response was YES. [2025-03-09 06:44:42,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82816 conditions, 26332 events. 16357/26332 cut-off events. For 41698/42958 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 185299 event pairs, 11141 based on Foata normal form. 575/25283 useless extension candidates. Maximal degree in co-relation 82638. Up to 17163 conditions per place. [2025-03-09 06:44:42,331 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 164 selfloop transitions, 75 changer transitions 0/277 dead transitions. [2025-03-09 06:44:42,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 277 transitions, 2308 flow [2025-03-09 06:44:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 06:44:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 06:44:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 911 transitions. [2025-03-09 06:44:42,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5103641456582633 [2025-03-09 06:44:42,333 INFO L175 Difference]: Start difference. First operand has 195 places, 181 transitions, 1315 flow. Second operand 17 states and 911 transitions. [2025-03-09 06:44:42,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 277 transitions, 2308 flow [2025-03-09 06:44:42,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 277 transitions, 2300 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:44:42,402 INFO L231 Difference]: Finished difference. Result has 215 places, 190 transitions, 1612 flow [2025-03-09 06:44:42,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1612, PETRI_PLACES=215, PETRI_TRANSITIONS=190} [2025-03-09 06:44:42,402 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 115 predicate places. [2025-03-09 06:44:42,402 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 190 transitions, 1612 flow [2025-03-09 06:44:42,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 45.84615384615385) internal successors, (1192), 26 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:42,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:42,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:42,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 06:44:42,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 06:44:42,603 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:42,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash 937792205, now seen corresponding path program 1 times [2025-03-09 06:44:42,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:42,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796645560] [2025-03-09 06:44:42,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:42,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:42,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 06:44:42,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:44:42,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:42,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:44:42,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:42,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796645560] [2025-03-09 06:44:42,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796645560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:44:42,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:44:42,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:44:42,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794657661] [2025-03-09 06:44:42,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:44:42,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:44:42,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:42,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:44:42,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:44:42,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-09 06:44:42,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 190 transitions, 1612 flow. Second operand has 7 states, 7 states have (on average 46.714285714285715) internal successors, (327), 7 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:42,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:42,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-09 06:44:42,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:46,485 INFO L124 PetriNetUnfolderBase]: 20154/34513 cut-off events. [2025-03-09 06:44:46,486 INFO L125 PetriNetUnfolderBase]: For 72550/75517 co-relation queries the response was YES. [2025-03-09 06:44:46,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117964 conditions, 34513 events. 20154/34513 cut-off events. For 72550/75517 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 281704 event pairs, 16652 based on Foata normal form. 732/32807 useless extension candidates. Maximal degree in co-relation 117744. Up to 15911 conditions per place. [2025-03-09 06:44:46,809 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 191 selfloop transitions, 26 changer transitions 0/253 dead transitions. [2025-03-09 06:44:46,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 253 transitions, 2440 flow [2025-03-09 06:44:46,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:44:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:44:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 345 transitions. [2025-03-09 06:44:46,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-03-09 06:44:46,810 INFO L175 Difference]: Start difference. First operand has 215 places, 190 transitions, 1612 flow. Second operand 6 states and 345 transitions. [2025-03-09 06:44:46,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 253 transitions, 2440 flow [2025-03-09 06:44:47,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 253 transitions, 2240 flow, removed 12 selfloop flow, removed 13 redundant places. [2025-03-09 06:44:47,051 INFO L231 Difference]: Finished difference. Result has 210 places, 198 transitions, 1564 flow [2025-03-09 06:44:47,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1564, PETRI_PLACES=210, PETRI_TRANSITIONS=198} [2025-03-09 06:44:47,051 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 110 predicate places. [2025-03-09 06:44:47,052 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 198 transitions, 1564 flow [2025-03-09 06:44:47,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.714285714285715) internal successors, (327), 7 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:47,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:47,052 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:47,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 06:44:47,052 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:47,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:47,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1437566766, now seen corresponding path program 1 times [2025-03-09 06:44:47,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:47,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994691074] [2025-03-09 06:44:47,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:47,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:47,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 06:44:47,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:44:47,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:47,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 06:44:47,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:47,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994691074] [2025-03-09 06:44:47,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994691074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:44:47,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780219156] [2025-03-09 06:44:47,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:47,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:44:47,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:44:47,265 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:44:47,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 06:44:47,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 06:44:47,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 06:44:47,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:47,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:47,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:44:47,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:44:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 06:44:47,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:44:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 06:44:47,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780219156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:44:47,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:44:47,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 06:44:47,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101943746] [2025-03-09 06:44:47,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:44:47,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 06:44:47,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:47,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 06:44:47,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:44:47,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 105 [2025-03-09 06:44:47,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 198 transitions, 1564 flow. Second operand has 15 states, 15 states have (on average 49.4) internal successors, (741), 15 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:47,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:47,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 105 [2025-03-09 06:44:47,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:51,643 INFO L124 PetriNetUnfolderBase]: 23398/38700 cut-off events. [2025-03-09 06:44:51,644 INFO L125 PetriNetUnfolderBase]: For 87043/90699 co-relation queries the response was YES. [2025-03-09 06:44:51,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129881 conditions, 38700 events. 23398/38700 cut-off events. For 87043/90699 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 307014 event pairs, 15716 based on Foata normal form. 884/35021 useless extension candidates. Maximal degree in co-relation 129652. Up to 26541 conditions per place. [2025-03-09 06:44:51,925 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 167 selfloop transitions, 64 changer transitions 0/277 dead transitions. [2025-03-09 06:44:51,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 277 transitions, 2569 flow [2025-03-09 06:44:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 06:44:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 06:44:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 682 transitions. [2025-03-09 06:44:51,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5412698412698412 [2025-03-09 06:44:51,926 INFO L175 Difference]: Start difference. First operand has 210 places, 198 transitions, 1564 flow. Second operand 12 states and 682 transitions. [2025-03-09 06:44:51,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 277 transitions, 2569 flow [2025-03-09 06:44:52,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 277 transitions, 2556 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:44:52,145 INFO L231 Difference]: Finished difference. Result has 223 places, 200 transitions, 1744 flow [2025-03-09 06:44:52,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1744, PETRI_PLACES=223, PETRI_TRANSITIONS=200} [2025-03-09 06:44:52,146 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 123 predicate places. [2025-03-09 06:44:52,146 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 200 transitions, 1744 flow [2025-03-09 06:44:52,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 49.4) internal successors, (741), 15 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:44:52,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:52,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:52,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-09 06:44:52,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 06:44:52,347 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:52,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:52,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1342366493, now seen corresponding path program 1 times [2025-03-09 06:44:52,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:52,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962197668] [2025-03-09 06:44:52,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:52,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:52,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 06:44:52,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 06:44:52,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:52,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:44:52,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:52,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962197668] [2025-03-09 06:44:52,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962197668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:44:52,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:44:52,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:44:52,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7379801] [2025-03-09 06:44:52,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:44:52,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:44:52,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:52,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:44:52,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:44:52,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-09 06:44:52,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 200 transitions, 1744 flow. Second operand has 6 states, 6 states have (on average 53.166666666666664) internal successors, (319), 6 states have internal predecessors, (319), 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-09 06:44:52,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:52,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-09 06:44:52,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:44:56,482 INFO L124 PetriNetUnfolderBase]: 20426/35284 cut-off events. [2025-03-09 06:44:56,483 INFO L125 PetriNetUnfolderBase]: For 79216/82438 co-relation queries the response was YES. [2025-03-09 06:44:56,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121312 conditions, 35284 events. 20426/35284 cut-off events. For 79216/82438 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 297401 event pairs, 16658 based on Foata normal form. 845/33216 useless extension candidates. Maximal degree in co-relation 121050. Up to 20560 conditions per place. [2025-03-09 06:44:56,813 INFO L140 encePairwiseOnDemand]: 94/105 looper letters, 182 selfloop transitions, 27 changer transitions 0/253 dead transitions. [2025-03-09 06:44:56,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 253 transitions, 2503 flow [2025-03-09 06:44:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:44:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:44:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 327 transitions. [2025-03-09 06:44:56,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6228571428571429 [2025-03-09 06:44:56,814 INFO L175 Difference]: Start difference. First operand has 223 places, 200 transitions, 1744 flow. Second operand 5 states and 327 transitions. [2025-03-09 06:44:56,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 253 transitions, 2503 flow [2025-03-09 06:44:56,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 253 transitions, 2429 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 06:44:56,994 INFO L231 Difference]: Finished difference. Result has 224 places, 208 transitions, 1840 flow [2025-03-09 06:44:56,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1670, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1840, PETRI_PLACES=224, PETRI_TRANSITIONS=208} [2025-03-09 06:44:56,995 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 124 predicate places. [2025-03-09 06:44:56,995 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 208 transitions, 1840 flow [2025-03-09 06:44:56,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.166666666666664) internal successors, (319), 6 states have internal predecessors, (319), 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-09 06:44:56,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:44:56,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:44:56,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-09 06:44:56,995 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:44:56,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:44:56,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1013599772, now seen corresponding path program 1 times [2025-03-09 06:44:56,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:44:56,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418356499] [2025-03-09 06:44:56,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:44:56,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:44:57,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 06:44:57,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 06:44:57,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:44:57,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:44:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:44:57,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:44:57,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418356499] [2025-03-09 06:44:57,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418356499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:44:57,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:44:57,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 06:44:57,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542245271] [2025-03-09 06:44:57,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:44:57,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:44:57,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:44:57,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:44:57,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:44:57,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 105 [2025-03-09 06:44:57,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 208 transitions, 1840 flow. Second operand has 9 states, 9 states have (on average 36.111111111111114) internal successors, (325), 9 states have internal predecessors, (325), 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-09 06:44:57,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:44:57,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 105 [2025-03-09 06:44:57,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:01,328 INFO L124 PetriNetUnfolderBase]: 20405/35202 cut-off events. [2025-03-09 06:45:01,328 INFO L125 PetriNetUnfolderBase]: For 84054/87568 co-relation queries the response was YES. [2025-03-09 06:45:01,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122977 conditions, 35202 events. 20405/35202 cut-off events. For 84054/87568 co-relation queries the response was YES. Maximal size of possible extension queue 1146. Compared 297097 event pairs, 12037 based on Foata normal form. 902/33514 useless extension candidates. Maximal degree in co-relation 122628. Up to 20560 conditions per place. [2025-03-09 06:45:01,672 INFO L140 encePairwiseOnDemand]: 87/105 looper letters, 186 selfloop transitions, 49 changer transitions 6/266 dead transitions. [2025-03-09 06:45:01,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 266 transitions, 2680 flow [2025-03-09 06:45:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 06:45:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 06:45:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 564 transitions. [2025-03-09 06:45:01,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3836734693877551 [2025-03-09 06:45:01,673 INFO L175 Difference]: Start difference. First operand has 224 places, 208 transitions, 1840 flow. Second operand 14 states and 564 transitions. [2025-03-09 06:45:01,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 266 transitions, 2680 flow [2025-03-09 06:45:01,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 266 transitions, 2680 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:45:01,835 INFO L231 Difference]: Finished difference. Result has 242 places, 217 transitions, 2046 flow [2025-03-09 06:45:01,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1840, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2046, PETRI_PLACES=242, PETRI_TRANSITIONS=217} [2025-03-09 06:45:01,835 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 142 predicate places. [2025-03-09 06:45:01,835 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 217 transitions, 2046 flow [2025-03-09 06:45:01,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.111111111111114) internal successors, (325), 9 states have internal predecessors, (325), 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-09 06:45:01,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:01,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:01,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-09 06:45:01,836 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:45:01,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:01,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2009849058, now seen corresponding path program 1 times [2025-03-09 06:45:01,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:01,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894868162] [2025-03-09 06:45:01,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:01,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:01,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 06:45:01,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 06:45:01,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:01,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:45:01,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:01,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894868162] [2025-03-09 06:45:01,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894868162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:01,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:01,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:45:01,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946004958] [2025-03-09 06:45:01,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:01,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:45:01,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:01,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:45:01,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:45:01,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 105 [2025-03-09 06:45:01,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 217 transitions, 2046 flow. Second operand has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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-09 06:45:01,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:01,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 105 [2025-03-09 06:45:01,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:06,142 INFO L124 PetriNetUnfolderBase]: 20382/35324 cut-off events. [2025-03-09 06:45:06,142 INFO L125 PetriNetUnfolderBase]: For 89019/92290 co-relation queries the response was YES. [2025-03-09 06:45:06,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124457 conditions, 35324 events. 20382/35324 cut-off events. For 89019/92290 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 299381 event pairs, 17000 based on Foata normal form. 859/33308 useless extension candidates. Maximal degree in co-relation 124139. Up to 16433 conditions per place. [2025-03-09 06:45:06,540 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 201 selfloop transitions, 19 changer transitions 0/270 dead transitions. [2025-03-09 06:45:06,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 270 transitions, 2812 flow [2025-03-09 06:45:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:45:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:45:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 308 transitions. [2025-03-09 06:45:06,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2025-03-09 06:45:06,542 INFO L175 Difference]: Start difference. First operand has 242 places, 217 transitions, 2046 flow. Second operand 5 states and 308 transitions. [2025-03-09 06:45:06,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 270 transitions, 2812 flow [2025-03-09 06:45:06,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 270 transitions, 2779 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-03-09 06:45:06,697 INFO L231 Difference]: Finished difference. Result has 243 places, 216 transitions, 2056 flow [2025-03-09 06:45:06,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1999, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2056, PETRI_PLACES=243, PETRI_TRANSITIONS=216} [2025-03-09 06:45:06,698 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 143 predicate places. [2025-03-09 06:45:06,698 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 216 transitions, 2056 flow [2025-03-09 06:45:06,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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-09 06:45:06,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:06,698 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:06,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-09 06:45:06,698 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:45:06,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:06,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1356822640, now seen corresponding path program 1 times [2025-03-09 06:45:06,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:06,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510488745] [2025-03-09 06:45:06,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:06,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:06,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 06:45:06,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 06:45:06,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:06,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:45:06,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:06,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510488745] [2025-03-09 06:45:06,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510488745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:06,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:06,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 06:45:06,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223624076] [2025-03-09 06:45:06,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:06,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:45:06,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:06,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:45:06,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:45:07,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 105 [2025-03-09 06:45:07,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 216 transitions, 2056 flow. Second operand has 8 states, 8 states have (on average 38.5) internal successors, (308), 8 states have internal predecessors, (308), 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-09 06:45:07,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:07,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 105 [2025-03-09 06:45:07,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:12,495 INFO L124 PetriNetUnfolderBase]: 25910/44450 cut-off events. [2025-03-09 06:45:12,495 INFO L125 PetriNetUnfolderBase]: For 108416/113027 co-relation queries the response was YES. [2025-03-09 06:45:12,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155692 conditions, 44450 events. 25910/44450 cut-off events. For 108416/113027 co-relation queries the response was YES. Maximal size of possible extension queue 1459. Compared 389009 event pairs, 21963 based on Foata normal form. 1144/41912 useless extension candidates. Maximal degree in co-relation 155395. Up to 24268 conditions per place. [2025-03-09 06:45:12,985 INFO L140 encePairwiseOnDemand]: 88/105 looper letters, 206 selfloop transitions, 35 changer transitions 15/288 dead transitions. [2025-03-09 06:45:12,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 288 transitions, 3070 flow [2025-03-09 06:45:12,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 06:45:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 06:45:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 591 transitions. [2025-03-09 06:45:12,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4020408163265306 [2025-03-09 06:45:12,986 INFO L175 Difference]: Start difference. First operand has 243 places, 216 transitions, 2056 flow. Second operand 14 states and 591 transitions. [2025-03-09 06:45:12,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 288 transitions, 3070 flow [2025-03-09 06:45:13,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 288 transitions, 3059 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:45:13,208 INFO L231 Difference]: Finished difference. Result has 262 places, 218 transitions, 2189 flow [2025-03-09 06:45:13,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2189, PETRI_PLACES=262, PETRI_TRANSITIONS=218} [2025-03-09 06:45:13,209 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 162 predicate places. [2025-03-09 06:45:13,209 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 218 transitions, 2189 flow [2025-03-09 06:45:13,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.5) internal successors, (308), 8 states have internal predecessors, (308), 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-09 06:45:13,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:13,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:13,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-09 06:45:13,210 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:45:13,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:13,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2119188339, now seen corresponding path program 1 times [2025-03-09 06:45:13,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:13,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700670366] [2025-03-09 06:45:13,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:13,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:13,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 06:45:13,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:45:13,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:13,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:45:13,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700670366] [2025-03-09 06:45:13,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700670366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:13,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:13,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 06:45:13,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581741970] [2025-03-09 06:45:13,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:13,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:45:13,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:13,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:45:13,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:45:13,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-09 06:45:13,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 218 transitions, 2189 flow. Second operand has 8 states, 8 states have (on average 46.25) internal successors, (370), 8 states have internal predecessors, (370), 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-09 06:45:13,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:13,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-09 06:45:13,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:19,616 INFO L124 PetriNetUnfolderBase]: 25914/44276 cut-off events. [2025-03-09 06:45:19,617 INFO L125 PetriNetUnfolderBase]: For 109054/113597 co-relation queries the response was YES. [2025-03-09 06:45:19,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155135 conditions, 44276 events. 25914/44276 cut-off events. For 109054/113597 co-relation queries the response was YES. Maximal size of possible extension queue 1462. Compared 385548 event pairs, 21621 based on Foata normal form. 1090/41627 useless extension candidates. Maximal degree in co-relation 155023. Up to 32383 conditions per place. [2025-03-09 06:45:20,108 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 181 selfloop transitions, 37 changer transitions 0/262 dead transitions. [2025-03-09 06:45:20,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 262 transitions, 2915 flow [2025-03-09 06:45:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:45:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:45:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 381 transitions. [2025-03-09 06:45:20,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2025-03-09 06:45:20,109 INFO L175 Difference]: Start difference. First operand has 262 places, 218 transitions, 2189 flow. Second operand 7 states and 381 transitions. [2025-03-09 06:45:20,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 262 transitions, 2915 flow [2025-03-09 06:45:20,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 262 transitions, 2886 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-03-09 06:45:20,333 INFO L231 Difference]: Finished difference. Result has 263 places, 220 transitions, 2286 flow [2025-03-09 06:45:20,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2160, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2286, PETRI_PLACES=263, PETRI_TRANSITIONS=220} [2025-03-09 06:45:20,334 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 163 predicate places. [2025-03-09 06:45:20,334 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 220 transitions, 2286 flow [2025-03-09 06:45:20,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 46.25) internal successors, (370), 8 states have internal predecessors, (370), 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-09 06:45:20,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:20,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:20,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-09 06:45:20,335 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:45:20,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:20,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1518760230, now seen corresponding path program 1 times [2025-03-09 06:45:20,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:20,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226751296] [2025-03-09 06:45:20,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:20,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:20,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 06:45:20,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 06:45:20,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:20,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:45:20,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:20,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226751296] [2025-03-09 06:45:20,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226751296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:20,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:20,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:45:20,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231345175] [2025-03-09 06:45:20,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:20,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:45:20,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:20,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:45:20,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:45:20,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 105 [2025-03-09 06:45:20,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 220 transitions, 2286 flow. Second operand has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:45:20,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:20,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 105 [2025-03-09 06:45:20,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:25,855 INFO L124 PetriNetUnfolderBase]: 25894/44140 cut-off events. [2025-03-09 06:45:25,855 INFO L125 PetriNetUnfolderBase]: For 111246/115853 co-relation queries the response was YES. [2025-03-09 06:45:26,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155045 conditions, 44140 events. 25894/44140 cut-off events. For 111246/115853 co-relation queries the response was YES. Maximal size of possible extension queue 1462. Compared 383398 event pairs, 21963 based on Foata normal form. 1115/41569 useless extension candidates. Maximal degree in co-relation 154762. Up to 24340 conditions per place. [2025-03-09 06:45:26,380 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 197 selfloop transitions, 22 changer transitions 1/262 dead transitions. [2025-03-09 06:45:26,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 262 transitions, 2946 flow [2025-03-09 06:45:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:45:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:45:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 341 transitions. [2025-03-09 06:45:26,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5412698412698412 [2025-03-09 06:45:26,381 INFO L175 Difference]: Start difference. First operand has 263 places, 220 transitions, 2286 flow. Second operand 6 states and 341 transitions. [2025-03-09 06:45:26,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 262 transitions, 2946 flow [2025-03-09 06:45:26,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 262 transitions, 2827 flow, removed 5 selfloop flow, removed 11 redundant places. [2025-03-09 06:45:26,607 INFO L231 Difference]: Finished difference. Result has 257 places, 210 transitions, 2124 flow [2025-03-09 06:45:26,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=2062, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2124, PETRI_PLACES=257, PETRI_TRANSITIONS=210} [2025-03-09 06:45:26,607 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 157 predicate places. [2025-03-09 06:45:26,607 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 210 transitions, 2124 flow [2025-03-09 06:45:26,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:45:26,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:26,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:26,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-09 06:45:26,608 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2025-03-09 06:45:26,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:26,608 INFO L85 PathProgramCache]: Analyzing trace with hash -724940954, now seen corresponding path program 1 times [2025-03-09 06:45:26,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:26,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951392163] [2025-03-09 06:45:26,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:26,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:26,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 06:45:26,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 06:45:26,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:26,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 06:45:26,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:26,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951392163] [2025-03-09 06:45:26,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951392163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:26,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:26,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:45:26,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970419600] [2025-03-09 06:45:26,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:26,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:45:26,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:26,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:45:26,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:45:26,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-03-09 06:45:26,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 210 transitions, 2124 flow. Second operand has 6 states, 6 states have (on average 53.833333333333336) internal successors, (323), 6 states have internal predecessors, (323), 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-09 06:45:26,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:26,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-03-09 06:45:26,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand