./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:52:55,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:52:55,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:52:55,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:52:55,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:52:55,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:52:55,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:52:55,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:52:55,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:52:55,444 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:52:55,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:52:55,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:52:55,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:52:55,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:52:55,445 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:52:55,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:52:55,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:52:55,445 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:52:55,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:52:55,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:52:55,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:52:55,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:52:55,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:52:55,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:52:55,445 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:52:55,445 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:52:55,445 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:52:55,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:52:55,445 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:52:55,446 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:52:55,446 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:52:55,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:52:55,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:52:55,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:52:55,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:55,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:52:55,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:52:55,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:52:55,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:52:55,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:55,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:52:55,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:52:55,446 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:52:55,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:52:55,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:52:55,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:52:55,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:52:55,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:52:55,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:52:55,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:52:55,447 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-jdk21/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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-01-10 06:52:55,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:52:55,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:52:55,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:52:55,746 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:52:55,746 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:52:55,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-01-10 06:52:56,998 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e05186f9/640227c7e5914c948c3da888fb6f7189/FLAGf4573f355 [2025-01-10 06:52:57,276 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:52:57,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-01-10 06:52:57,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e05186f9/640227c7e5914c948c3da888fb6f7189/FLAGf4573f355 [2025-01-10 06:52:57,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e05186f9/640227c7e5914c948c3da888fb6f7189 [2025-01-10 06:52:57,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:52:57,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:52:57,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:52:57,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:52:57,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:52:57,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57, skipping insertion in model container [2025-01-10 06:52:57,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:52:57,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:52:57,567 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:52:57,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:52:57,610 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:52:57,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57 WrapperNode [2025-01-10 06:52:57,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:52:57,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:52:57,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:52:57,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:52:57,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,671 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 331 [2025-01-10 06:52:57,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:52:57,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:52:57,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:52:57,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:52:57,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,716 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 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-01-10 06:52:57,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,731 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:52:57,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:52:57,753 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:52:57,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:52:57,754 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57" (1/1) ... [2025-01-10 06:52:57,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:57,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:57,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:52:57,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:52:57,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:52:57,833 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:52:57,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:52:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:52:57,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:52:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:52:57,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:52:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:52:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:52:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:52:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:52:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:52:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:52:57,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:52:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:52:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:52:57,835 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:52:58,007 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:52:58,012 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:52:58,625 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:52:58,626 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:52:58,908 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:52:58,908 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:52:58,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:52:58 BoogieIcfgContainer [2025-01-10 06:52:58,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:52:58,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:52:58,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:52:58,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:52:58,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:52:57" (1/3) ... [2025-01-10 06:52:58,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fd47d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:52:58, skipping insertion in model container [2025-01-10 06:52:58,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:57" (2/3) ... [2025-01-10 06:52:58,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fd47d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:52:58, skipping insertion in model container [2025-01-10 06:52:58,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:52:58" (3/3) ... [2025-01-10 06:52:58,918 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-01-10 06:52:58,933 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:52:58,935 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 128 locations, 1 initial locations, 6 loop locations, and 42 error locations. [2025-01-10 06:52:58,935 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:52:59,019 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:52:59,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 143 transitions, 307 flow [2025-01-10 06:52:59,123 INFO L124 PetriNetUnfolderBase]: 16/140 cut-off events. [2025-01-10 06:52:59,127 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:52:59,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 16/140 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 489 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2025-01-10 06:52:59,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 143 transitions, 307 flow [2025-01-10 06:52:59,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 139 transitions, 296 flow [2025-01-10 06:52:59,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:52:59,157 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;@7847aa09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:52:59,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2025-01-10 06:52:59,163 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:52:59,164 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:52:59,164 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:52:59,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:59,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:52:59,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-01-10 06:52:59,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:59,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1035909, now seen corresponding path program 1 times [2025-01-10 06:52:59,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:59,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904059021] [2025-01-10 06:52:59,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:59,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:59,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:52:59,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:52:59,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:59,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:59,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:59,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904059021] [2025-01-10 06:52:59,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904059021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:59,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:59,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:59,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449234450] [2025-01-10 06:52:59,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:59,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:52:59,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:59,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:52:59,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:52:59,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2025-01-10 06:52:59,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 139 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 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-01-10 06:52:59,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:59,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2025-01-10 06:52:59,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:01,055 INFO L124 PetriNetUnfolderBase]: 5997/13097 cut-off events. [2025-01-10 06:53:01,057 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-01-10 06:53:01,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21249 conditions, 13097 events. 5997/13097 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 123708 event pairs, 3911 based on Foata normal form. 3/10269 useless extension candidates. Maximal degree in co-relation 20178. Up to 7893 conditions per place. [2025-01-10 06:53:01,178 INFO L140 encePairwiseOnDemand]: 127/143 looper letters, 61 selfloop transitions, 10 changer transitions 0/148 dead transitions. [2025-01-10 06:53:01,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 148 transitions, 456 flow [2025-01-10 06:53:01,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2025-01-10 06:53:01,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6940559440559441 [2025-01-10 06:53:01,199 INFO L175 Difference]: Start difference. First operand has 133 places, 139 transitions, 296 flow. Second operand 4 states and 397 transitions. [2025-01-10 06:53:01,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 148 transitions, 456 flow [2025-01-10 06:53:01,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 148 transitions, 444 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 06:53:01,220 INFO L231 Difference]: Finished difference. Result has 133 places, 148 transitions, 372 flow [2025-01-10 06:53:01,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=372, PETRI_PLACES=133, PETRI_TRANSITIONS=148} [2025-01-10 06:53:01,225 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 0 predicate places. [2025-01-10 06:53:01,228 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 148 transitions, 372 flow [2025-01-10 06:53:01,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 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-01-10 06:53:01,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:01,229 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:53:01,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:53:01,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-01-10 06:53:01,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:01,230 INFO L85 PathProgramCache]: Analyzing trace with hash 797011597, now seen corresponding path program 1 times [2025-01-10 06:53:01,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:01,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292843313] [2025-01-10 06:53:01,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:01,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:01,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:53:01,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:53:01,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:01,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:01,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:01,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292843313] [2025-01-10 06:53:01,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292843313] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:53:01,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689253620] [2025-01-10 06:53:01,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:01,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:01,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:01,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:53:01,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:53:01,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:53:01,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:53:01,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:01,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:01,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:53:01,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:53:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:01,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:53:01,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689253620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:01,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:53:01,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:53:01,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871561421] [2025-01-10 06:53:01,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:01,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:53:01,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:01,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:53:01,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:53:01,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2025-01-10 06:53:01,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 148 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 80.83333333333333) internal successors, (485), 6 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:01,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:01,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2025-01-10 06:53:01,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:02,447 INFO L124 PetriNetUnfolderBase]: 5997/13094 cut-off events. [2025-01-10 06:53:02,447 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-01-10 06:53:02,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21099 conditions, 13094 events. 5997/13094 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 123615 event pairs, 3911 based on Foata normal form. 3/10271 useless extension candidates. Maximal degree in co-relation 21026. Up to 7878 conditions per place. [2025-01-10 06:53:02,518 INFO L140 encePairwiseOnDemand]: 130/143 looper letters, 51 selfloop transitions, 17 changer transitions 0/145 dead transitions. [2025-01-10 06:53:02,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 145 transitions, 496 flow [2025-01-10 06:53:02,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:53:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:53:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 551 transitions. [2025-01-10 06:53:02,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6421911421911422 [2025-01-10 06:53:02,523 INFO L175 Difference]: Start difference. First operand has 133 places, 148 transitions, 372 flow. Second operand 6 states and 551 transitions. [2025-01-10 06:53:02,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 145 transitions, 496 flow [2025-01-10 06:53:02,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 145 transitions, 496 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:53:02,527 INFO L231 Difference]: Finished difference. Result has 135 places, 145 transitions, 394 flow [2025-01-10 06:53:02,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=394, PETRI_PLACES=135, PETRI_TRANSITIONS=145} [2025-01-10 06:53:02,529 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 2 predicate places. [2025-01-10 06:53:02,529 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 145 transitions, 394 flow [2025-01-10 06:53:02,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.83333333333333) internal successors, (485), 6 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:02,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:02,530 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:53:02,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:53:02,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:02,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-01-10 06:53:02,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:02,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1062443244, now seen corresponding path program 1 times [2025-01-10 06:53:02,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:02,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954606034] [2025-01-10 06:53:02,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:02,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:02,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:53:02,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:53:02,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:02,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:02,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:02,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:02,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954606034] [2025-01-10 06:53:02,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954606034] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:53:02,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997652178] [2025-01-10 06:53:02,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:02,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:02,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:02,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:53:02,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:53:02,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:53:02,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:53:02,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:02,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:02,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:53:02,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:53:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:02,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:53:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:02,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997652178] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:53:02,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:53:02,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 06:53:02,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340651584] [2025-01-10 06:53:02,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:53:02,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:53:02,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:02,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:53:02,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:53:03,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2025-01-10 06:53:03,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 145 transitions, 394 flow. Second operand has 12 states, 12 states have (on average 81.08333333333333) internal successors, (973), 12 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:03,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:03,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2025-01-10 06:53:03,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:04,077 INFO L124 PetriNetUnfolderBase]: 6006/13130 cut-off events. [2025-01-10 06:53:04,078 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-01-10 06:53:04,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21240 conditions, 13130 events. 6006/13130 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 124090 event pairs, 3911 based on Foata normal form. 9/10313 useless extension candidates. Maximal degree in co-relation 21028. Up to 7893 conditions per place. [2025-01-10 06:53:04,162 INFO L140 encePairwiseOnDemand]: 130/143 looper letters, 58 selfloop transitions, 37 changer transitions 0/172 dead transitions. [2025-01-10 06:53:04,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 172 transitions, 758 flow [2025-01-10 06:53:04,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:53:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:53:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 904 transitions. [2025-01-10 06:53:04,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6321678321678321 [2025-01-10 06:53:04,165 INFO L175 Difference]: Start difference. First operand has 135 places, 145 transitions, 394 flow. Second operand 10 states and 904 transitions. [2025-01-10 06:53:04,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 172 transitions, 758 flow [2025-01-10 06:53:04,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 172 transitions, 675 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-01-10 06:53:04,174 INFO L231 Difference]: Finished difference. Result has 142 places, 172 transitions, 609 flow [2025-01-10 06:53:04,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=609, PETRI_PLACES=142, PETRI_TRANSITIONS=172} [2025-01-10 06:53:04,178 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 9 predicate places. [2025-01-10 06:53:04,178 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 172 transitions, 609 flow [2025-01-10 06:53:04,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 81.08333333333333) internal successors, (973), 12 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:04,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:04,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:04,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:53:04,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:04,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-01-10 06:53:04,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:04,381 INFO L85 PathProgramCache]: Analyzing trace with hash 63743149, now seen corresponding path program 1 times [2025-01-10 06:53:04,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:04,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352164108] [2025-01-10 06:53:04,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:04,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:04,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:53:04,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:53:04,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:04,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:04,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:04,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352164108] [2025-01-10 06:53:04,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352164108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:04,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:04,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:53:04,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648032624] [2025-01-10 06:53:04,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:04,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:04,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:04,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:04,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2025-01-10 06:53:04,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 172 transitions, 609 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:04,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:04,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2025-01-10 06:53:04,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:05,881 INFO L124 PetriNetUnfolderBase]: 12092/21968 cut-off events. [2025-01-10 06:53:05,881 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2025-01-10 06:53:05,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38241 conditions, 21968 events. 12092/21968 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 913. Compared 191458 event pairs, 3871 based on Foata normal form. 544/18384 useless extension candidates. Maximal degree in co-relation 38143. Up to 7301 conditions per place. [2025-01-10 06:53:06,047 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 152 selfloop transitions, 5 changer transitions 0/231 dead transitions. [2025-01-10 06:53:06,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 231 transitions, 1045 flow [2025-01-10 06:53:06,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions. [2025-01-10 06:53:06,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7762237762237763 [2025-01-10 06:53:06,050 INFO L175 Difference]: Start difference. First operand has 142 places, 172 transitions, 609 flow. Second operand 4 states and 444 transitions. [2025-01-10 06:53:06,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 231 transitions, 1045 flow [2025-01-10 06:53:06,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 231 transitions, 1008 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-10 06:53:06,055 INFO L231 Difference]: Finished difference. Result has 145 places, 174 transitions, 606 flow [2025-01-10 06:53:06,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=606, PETRI_PLACES=145, PETRI_TRANSITIONS=174} [2025-01-10 06:53:06,056 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 12 predicate places. [2025-01-10 06:53:06,056 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 174 transitions, 606 flow [2025-01-10 06:53:06,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:06,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:06,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:06,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:53:06,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-01-10 06:53:06,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:06,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1976038787, now seen corresponding path program 1 times [2025-01-10 06:53:06,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:06,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548674469] [2025-01-10 06:53:06,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:06,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:06,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:53:06,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:53:06,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:06,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:06,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:06,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:06,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548674469] [2025-01-10 06:53:06,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548674469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:06,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:06,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:53:06,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633134458] [2025-01-10 06:53:06,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:06,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:53:06,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:06,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:53:06,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:53:06,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 143 [2025-01-10 06:53:06,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 174 transitions, 606 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:06,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:06,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 143 [2025-01-10 06:53:06,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:07,796 INFO L124 PetriNetUnfolderBase]: 9699/20682 cut-off events. [2025-01-10 06:53:07,797 INFO L125 PetriNetUnfolderBase]: For 3234/3608 co-relation queries the response was YES. [2025-01-10 06:53:07,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35998 conditions, 20682 events. 9699/20682 cut-off events. For 3234/3608 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 200917 event pairs, 5958 based on Foata normal form. 463/17350 useless extension candidates. Maximal degree in co-relation 35902. Up to 10058 conditions per place. [2025-01-10 06:53:07,932 INFO L140 encePairwiseOnDemand]: 131/143 looper letters, 145 selfloop transitions, 18 changer transitions 0/243 dead transitions. [2025-01-10 06:53:07,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 243 transitions, 1083 flow [2025-01-10 06:53:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:53:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:53:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2025-01-10 06:53:07,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7610722610722611 [2025-01-10 06:53:07,934 INFO L175 Difference]: Start difference. First operand has 145 places, 174 transitions, 606 flow. Second operand 6 states and 653 transitions. [2025-01-10 06:53:07,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 243 transitions, 1083 flow [2025-01-10 06:53:07,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 243 transitions, 1083 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:53:07,954 INFO L231 Difference]: Finished difference. Result has 154 places, 178 transitions, 691 flow [2025-01-10 06:53:07,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=691, PETRI_PLACES=154, PETRI_TRANSITIONS=178} [2025-01-10 06:53:07,955 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 21 predicate places. [2025-01-10 06:53:07,955 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 178 transitions, 691 flow [2025-01-10 06:53:07,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:07,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:07,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:07,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:53:07,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-01-10 06:53:07,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:07,956 INFO L85 PathProgramCache]: Analyzing trace with hash -874811179, now seen corresponding path program 1 times [2025-01-10 06:53:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:07,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661629718] [2025-01-10 06:53:07,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:07,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:07,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:53:07,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:53:07,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:07,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:08,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:08,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661629718] [2025-01-10 06:53:08,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661629718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:08,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:08,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:53:08,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461662507] [2025-01-10 06:53:08,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:08,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:08,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:08,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:08,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:08,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2025-01-10 06:53:08,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 178 transitions, 691 flow. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:08,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:08,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2025-01-10 06:53:08,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:10,662 INFO L124 PetriNetUnfolderBase]: 20129/37111 cut-off events. [2025-01-10 06:53:10,662 INFO L125 PetriNetUnfolderBase]: For 10301/10661 co-relation queries the response was YES. [2025-01-10 06:53:10,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72962 conditions, 37111 events. 20129/37111 cut-off events. For 10301/10661 co-relation queries the response was YES. Maximal size of possible extension queue 1362. Compared 345318 event pairs, 6533 based on Foata normal form. 1106/32770 useless extension candidates. Maximal degree in co-relation 72859. Up to 12800 conditions per place. [2025-01-10 06:53:11,258 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 164 selfloop transitions, 5 changer transitions 0/243 dead transitions. [2025-01-10 06:53:11,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 243 transitions, 1227 flow [2025-01-10 06:53:11,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 442 transitions. [2025-01-10 06:53:11,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7727272727272727 [2025-01-10 06:53:11,260 INFO L175 Difference]: Start difference. First operand has 154 places, 178 transitions, 691 flow. Second operand 4 states and 442 transitions. [2025-01-10 06:53:11,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 243 transitions, 1227 flow [2025-01-10 06:53:11,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 243 transitions, 1211 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 06:53:11,342 INFO L231 Difference]: Finished difference. Result has 158 places, 180 transitions, 709 flow [2025-01-10 06:53:11,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=709, PETRI_PLACES=158, PETRI_TRANSITIONS=180} [2025-01-10 06:53:11,344 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 25 predicate places. [2025-01-10 06:53:11,345 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 180 transitions, 709 flow [2025-01-10 06:53:11,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:11,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:11,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:11,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:53:11,345 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-01-10 06:53:11,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1349341580, now seen corresponding path program 1 times [2025-01-10 06:53:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:11,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631968814] [2025-01-10 06:53:11,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:11,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:53:11,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:53:11,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:11,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631968814] [2025-01-10 06:53:11,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631968814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:11,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:11,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:53:11,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227912689] [2025-01-10 06:53:11,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:11,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:53:11,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:11,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:53:11,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:53:11,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 143 [2025-01-10 06:53:11,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 180 transitions, 709 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:11,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:11,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 143 [2025-01-10 06:53:11,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:13,304 INFO L124 PetriNetUnfolderBase]: 10273/22478 cut-off events. [2025-01-10 06:53:13,304 INFO L125 PetriNetUnfolderBase]: For 8867/9788 co-relation queries the response was YES. [2025-01-10 06:53:13,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43215 conditions, 22478 events. 10273/22478 cut-off events. For 8867/9788 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 228165 event pairs, 6898 based on Foata normal form. 583/19328 useless extension candidates. Maximal degree in co-relation 43110. Up to 12830 conditions per place. [2025-01-10 06:53:13,510 INFO L140 encePairwiseOnDemand]: 133/143 looper letters, 132 selfloop transitions, 18 changer transitions 0/230 dead transitions. [2025-01-10 06:53:13,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 230 transitions, 1125 flow [2025-01-10 06:53:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:53:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:53:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 636 transitions. [2025-01-10 06:53:13,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7412587412587412 [2025-01-10 06:53:13,515 INFO L175 Difference]: Start difference. First operand has 158 places, 180 transitions, 709 flow. Second operand 6 states and 636 transitions. [2025-01-10 06:53:13,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 230 transitions, 1125 flow [2025-01-10 06:53:13,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 230 transitions, 1125 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:53:13,549 INFO L231 Difference]: Finished difference. Result has 165 places, 182 transitions, 761 flow [2025-01-10 06:53:13,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=761, PETRI_PLACES=165, PETRI_TRANSITIONS=182} [2025-01-10 06:53:13,549 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 32 predicate places. [2025-01-10 06:53:13,549 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 182 transitions, 761 flow [2025-01-10 06:53:13,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:13,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:13,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:13,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:53:13,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-01-10 06:53:13,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1847465911, now seen corresponding path program 1 times [2025-01-10 06:53:13,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:13,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457234170] [2025-01-10 06:53:13,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:13,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:13,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:53:13,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:53:13,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:13,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:13,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:13,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457234170] [2025-01-10 06:53:13,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457234170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:13,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:13,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:53:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855934982] [2025-01-10 06:53:13,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:13,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:13,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:13,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:13,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 143 [2025-01-10 06:53:13,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 182 transitions, 761 flow. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:13,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:13,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 143 [2025-01-10 06:53:13,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:16,876 INFO L124 PetriNetUnfolderBase]: 22888/42232 cut-off events. [2025-01-10 06:53:16,876 INFO L125 PetriNetUnfolderBase]: For 23441/25214 co-relation queries the response was YES. [2025-01-10 06:53:17,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91565 conditions, 42232 events. 22888/42232 cut-off events. For 23441/25214 co-relation queries the response was YES. Maximal size of possible extension queue 1759. Compared 403631 event pairs, 6993 based on Foata normal form. 2063/38868 useless extension candidates. Maximal degree in co-relation 91455. Up to 13087 conditions per place. [2025-01-10 06:53:17,233 INFO L140 encePairwiseOnDemand]: 128/143 looper letters, 168 selfloop transitions, 10 changer transitions 0/246 dead transitions. [2025-01-10 06:53:17,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 246 transitions, 1377 flow [2025-01-10 06:53:17,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 418 transitions. [2025-01-10 06:53:17,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2025-01-10 06:53:17,236 INFO L175 Difference]: Start difference. First operand has 165 places, 182 transitions, 761 flow. Second operand 4 states and 418 transitions. [2025-01-10 06:53:17,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 246 transitions, 1377 flow [2025-01-10 06:53:17,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 246 transitions, 1347 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:53:17,431 INFO L231 Difference]: Finished difference. Result has 166 places, 186 transitions, 797 flow [2025-01-10 06:53:17,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=797, PETRI_PLACES=166, PETRI_TRANSITIONS=186} [2025-01-10 06:53:17,432 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 33 predicate places. [2025-01-10 06:53:17,432 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 186 transitions, 797 flow [2025-01-10 06:53:17,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:17,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:17,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:17,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:53:17,433 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-01-10 06:53:17,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1436867175, now seen corresponding path program 1 times [2025-01-10 06:53:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:17,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344991207] [2025-01-10 06:53:17,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:17,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:17,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:53:17,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:53:17,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:17,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:17,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:17,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344991207] [2025-01-10 06:53:17,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344991207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:17,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:17,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:53:17,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074863733] [2025-01-10 06:53:17,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:17,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:53:17,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:17,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:53:17,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:53:17,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 143 [2025-01-10 06:53:17,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 186 transitions, 797 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:17,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:17,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 143 [2025-01-10 06:53:17,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:19,897 INFO L124 PetriNetUnfolderBase]: 13990/30426 cut-off events. [2025-01-10 06:53:19,898 INFO L125 PetriNetUnfolderBase]: For 19543/21175 co-relation queries the response was YES. [2025-01-10 06:53:20,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65833 conditions, 30426 events. 13990/30426 cut-off events. For 19543/21175 co-relation queries the response was YES. Maximal size of possible extension queue 1351. Compared 327148 event pairs, 9891 based on Foata normal form. 874/27615 useless extension candidates. Maximal degree in co-relation 65723. Up to 18014 conditions per place. [2025-01-10 06:53:20,328 INFO L140 encePairwiseOnDemand]: 133/143 looper letters, 111 selfloop transitions, 18 changer transitions 0/209 dead transitions. [2025-01-10 06:53:20,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 209 transitions, 1125 flow [2025-01-10 06:53:20,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:53:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:53:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2025-01-10 06:53:20,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2025-01-10 06:53:20,330 INFO L175 Difference]: Start difference. First operand has 166 places, 186 transitions, 797 flow. Second operand 6 states and 611 transitions. [2025-01-10 06:53:20,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 209 transitions, 1125 flow [2025-01-10 06:53:20,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 209 transitions, 1125 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:53:20,466 INFO L231 Difference]: Finished difference. Result has 173 places, 188 transitions, 849 flow [2025-01-10 06:53:20,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=849, PETRI_PLACES=173, PETRI_TRANSITIONS=188} [2025-01-10 06:53:20,467 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 40 predicate places. [2025-01-10 06:53:20,467 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 188 transitions, 849 flow [2025-01-10 06:53:20,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:20,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:20,468 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-01-10 06:53:20,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:53:20,468 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-01-10 06:53:20,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:20,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1179762716, now seen corresponding path program 2 times [2025-01-10 06:53:20,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:20,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667893656] [2025-01-10 06:53:20,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:53:20,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:20,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:53:20,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-01-10 06:53:20,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:53:20,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:53:20,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:20,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667893656] [2025-01-10 06:53:20,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667893656] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:53:20,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863475472] [2025-01-10 06:53:20,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:53:20,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:20,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:20,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:53:20,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:53:20,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:53:20,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-01-10 06:53:20,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:53:20,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:20,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:53:20,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:53:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:53:20,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:53:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:53:20,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863475472] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:53:20,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:53:20,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-01-10 06:53:20,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038127040] [2025-01-10 06:53:20,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:53:20,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:20,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:20,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:20,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:20,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2025-01-10 06:53:20,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 188 transitions, 849 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 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-01-10 06:53:20,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:20,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2025-01-10 06:53:20,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:23,587 INFO L124 PetriNetUnfolderBase]: 13970/30790 cut-off events. [2025-01-10 06:53:23,587 INFO L125 PetriNetUnfolderBase]: For 20492/22051 co-relation queries the response was YES. [2025-01-10 06:53:23,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67086 conditions, 30790 events. 13970/30790 cut-off events. For 20492/22051 co-relation queries the response was YES. Maximal size of possible extension queue 1426. Compared 333981 event pairs, 9883 based on Foata normal form. 822/27860 useless extension candidates. Maximal degree in co-relation 66974. Up to 18156 conditions per place. [2025-01-10 06:53:23,874 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 94 selfloop transitions, 16 changer transitions 0/187 dead transitions. [2025-01-10 06:53:23,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 187 transitions, 1059 flow [2025-01-10 06:53:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:23,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2025-01-10 06:53:23,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625874125874126 [2025-01-10 06:53:23,876 INFO L175 Difference]: Start difference. First operand has 173 places, 188 transitions, 849 flow. Second operand 4 states and 379 transitions. [2025-01-10 06:53:23,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 187 transitions, 1059 flow [2025-01-10 06:53:24,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 187 transitions, 1029 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:53:24,022 INFO L231 Difference]: Finished difference. Result has 172 places, 187 transitions, 841 flow [2025-01-10 06:53:24,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=841, PETRI_PLACES=172, PETRI_TRANSITIONS=187} [2025-01-10 06:53:24,024 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 39 predicate places. [2025-01-10 06:53:24,024 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 187 transitions, 841 flow [2025-01-10 06:53:24,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 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-01-10 06:53:24,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:24,024 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-01-10 06:53:24,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:53:24,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:24,229 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-01-10 06:53:24,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:24,230 INFO L85 PathProgramCache]: Analyzing trace with hash 928594097, now seen corresponding path program 1 times [2025-01-10 06:53:24,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:24,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629788787] [2025-01-10 06:53:24,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:24,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:24,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:53:24,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:53:24,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:24,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:24,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:24,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629788787] [2025-01-10 06:53:24,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629788787] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:53:24,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896161333] [2025-01-10 06:53:24,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:24,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:24,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:24,863 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:53:24,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:53:24,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:53:24,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:53:24,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:24,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:24,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 06:53:24,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:53:24,959 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-01-10 06:53:24,986 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-01-10 06:53:25,030 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 06:53:25,030 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 17 treesize of output 21 [2025-01-10 06:53:25,065 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-01-10 06:53:25,149 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-10 06:53:25,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-01-10 06:53:25,172 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-01-10 06:53:25,214 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-01-10 06:53:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:25,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:53:25,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:53:25,466 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-01-10 06:53:25,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:53:25,476 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-01-10 06:53:25,483 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-01-10 06:53:25,489 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-01-10 06:53:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:25,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896161333] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:53:25,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:53:25,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2025-01-10 06:53:25,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372854327] [2025-01-10 06:53:25,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:53:25,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 06:53:25,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:25,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 06:53:25,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=500, Unknown=4, NotChecked=0, Total=600 [2025-01-10 06:53:25,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 143 [2025-01-10 06:53:25,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 187 transitions, 841 flow. Second operand has 25 states, 25 states have (on average 78.72) internal successors, (1968), 25 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:25,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:25,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 143 [2025-01-10 06:53:25,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:34,106 INFO L124 PetriNetUnfolderBase]: 59454/91761 cut-off events. [2025-01-10 06:53:34,106 INFO L125 PetriNetUnfolderBase]: For 71607/78921 co-relation queries the response was YES. [2025-01-10 06:53:34,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230837 conditions, 91761 events. 59454/91761 cut-off events. For 71607/78921 co-relation queries the response was YES. Maximal size of possible extension queue 2735. Compared 766838 event pairs, 12789 based on Foata normal form. 3751/88986 useless extension candidates. Maximal degree in co-relation 230724. Up to 28504 conditions per place. [2025-01-10 06:53:35,195 INFO L140 encePairwiseOnDemand]: 124/143 looper letters, 271 selfloop transitions, 35 changer transitions 0/376 dead transitions. [2025-01-10 06:53:35,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 376 transitions, 2184 flow [2025-01-10 06:53:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:53:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:53:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1237 transitions. [2025-01-10 06:53:35,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6654115115653577 [2025-01-10 06:53:35,203 INFO L175 Difference]: Start difference. First operand has 172 places, 187 transitions, 841 flow. Second operand 13 states and 1237 transitions. [2025-01-10 06:53:35,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 376 transitions, 2184 flow [2025-01-10 06:53:35,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 376 transitions, 2152 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:53:35,563 INFO L231 Difference]: Finished difference. Result has 184 places, 199 transitions, 989 flow [2025-01-10 06:53:35,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=989, PETRI_PLACES=184, PETRI_TRANSITIONS=199} [2025-01-10 06:53:35,564 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, 51 predicate places. [2025-01-10 06:53:35,564 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 199 transitions, 989 flow [2025-01-10 06:53:35,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 78.72) internal successors, (1968), 25 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:35,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:35,565 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:35,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:53:35,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 06:53:35,769 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-01-10 06:53:35,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:35,769 INFO L85 PathProgramCache]: Analyzing trace with hash 571102481, now seen corresponding path program 1 times [2025-01-10 06:53:35,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:35,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528394140] [2025-01-10 06:53:35,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:35,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:35,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:53:35,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:53:35,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:35,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:53:35,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:35,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528394140] [2025-01-10 06:53:35,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528394140] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:53:35,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733854955] [2025-01-10 06:53:35,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:35,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:35,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:35,988 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:53:35,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:53:36,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:53:36,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:53:36,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:36,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:36,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 06:53:36,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:53:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:53:36,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:53:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:53:36,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733854955] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:53:36,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:53:36,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-01-10 06:53:36,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633492784] [2025-01-10 06:53:36,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:53:36,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 06:53:36,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:36,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 06:53:36,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-01-10 06:53:36,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 143 [2025-01-10 06:53:36,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 199 transitions, 989 flow. Second operand has 19 states, 19 states have (on average 81.21052631578948) internal successors, (1543), 19 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:36,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:36,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 143 [2025-01-10 06:53:36,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand