./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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/parallel-misc-1.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 faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:10:00,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:10:00,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:10:00,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:10:00,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:10:00,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:10:00,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:10:00,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:10:00,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:10:00,612 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:10:00,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:10:00,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:10:00,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:10:00,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:10:00,612 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:10:00,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:10:00,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:10:00,613 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:10:00,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:10:00,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:10:00,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:10:00,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:10:00,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:10:00,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:10:00,614 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:10:00,614 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:10:00,614 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:10:00,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:10:00,614 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:10:00,614 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:10:00,615 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:10:00,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:10:00,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:10:00,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:10:00,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:10:00,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:10:00,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:10:00,615 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:10:00,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:10:00,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:10:00,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:10:00,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:10:00,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:10:00,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:10:00,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:10:00,616 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 -> faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 [2025-02-08 14:10:00,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:10:00,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:10:00,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:10:00,917 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:10:00,917 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:10:00,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-02-08 14:10:02,288 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee12ad34c/e7737a75955949f998a197c8f7c305d0/FLAG48acd9d9e [2025-02-08 14:10:02,554 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:10:02,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-02-08 14:10:02,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee12ad34c/e7737a75955949f998a197c8f7c305d0/FLAG48acd9d9e [2025-02-08 14:10:02,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee12ad34c/e7737a75955949f998a197c8f7c305d0 [2025-02-08 14:10:02,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:10:02,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:10:02,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:10:02,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:10:02,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:10:02,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:10:02" (1/1) ... [2025-02-08 14:10:02,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b5fcf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02, skipping insertion in model container [2025-02-08 14:10:02,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:10:02" (1/1) ... [2025-02-08 14:10:02,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:10:02,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:10:02,764 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:10:02,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:10:02,808 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:10:02,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02 WrapperNode [2025-02-08 14:10:02,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:10:02,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:10:02,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:10:02,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:10:02,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02" (1/1) ... [2025-02-08 14:10:02,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02" (1/1) ... [2025-02-08 14:10:02,850 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 18, calls inlined = 32, statements flattened = 388 [2025-02-08 14:10:02,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:10:02,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:10:02,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:10:02,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:10:02,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02" (1/1) ... [2025-02-08 14:10:02,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02" (1/1) ... [2025-02-08 14:10:02,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02" (1/1) ... [2025-02-08 14:10:02,882 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-08 14:10:02,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02" (1/1) ... [2025-02-08 14:10:02,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02" (1/1) ... [2025-02-08 14:10:02,892 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02" (1/1) ... [2025-02-08 14:10:02,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02" (1/1) ... [2025-02-08 14:10:02,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02" (1/1) ... [2025-02-08 14:10:02,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02" (1/1) ... [2025-02-08 14:10:02,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:10:02,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:10:02,910 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:10:02,910 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:10:02,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02" (1/1) ... [2025-02-08 14:10:02,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:10:02,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:10:02,953 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-02-08 14:10:02,961 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-02-08 14:10:02,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:10:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:10:02,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:10:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:10:02,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:10:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:10:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:10:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:10:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:10:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:10:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:10:02,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:10:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:10:02,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:10:02,980 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:10:03,080 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:10:03,082 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:10:03,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,484 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-4: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-5: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: havoc #t~ret5#1; [2025-02-08 14:10:03,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-1: ~sum1~0 := #t~ret5#1; [2025-02-08 14:10:03,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-2: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 14:10:03,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-3: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:10:03,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-4: havoc plus_#t~short34#1, plus_#t~short35#1, plus_~a#1, plus_~b#1; [2025-02-08 14:10:03,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-5: #t~ret5#1 := plus_#res#1; [2025-02-08 14:10:03,485 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-6: havoc plus_#t~short34#1, plus_#t~short35#1, plus_~a#1, plus_~b#1; [2025-02-08 14:10:03,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-7: havoc plus_#res#1; [2025-02-08 14:10:03,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-8: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~sum1~0, ~bag1~0; [2025-02-08 14:10:03,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-4: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-4: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:10:03,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-5: assume false; [2025-02-08 14:10:03,488 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-6: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-6: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:10:03,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-7: assume false; [2025-02-08 14:10:03,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-8: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-8: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:10:03,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-9: assume false; [2025-02-08 14:10:03,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-10: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,489 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-10: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:10:03,490 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-11: assume false; [2025-02-08 14:10:03,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-2: plus_~b#1 := plus_#in~b#1; [2025-02-08 14:10:03,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53: havoc #t~mem6#1; [2025-02-08 14:10:03,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-3: plus_~a#1 := plus_#in~a#1; [2025-02-08 14:10:03,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-1: ~bag1~0 := #t~mem6#1; [2025-02-08 14:10:03,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L53-2: SUMMARY for call #t~mem6#1 := read~int#1(~A~0.base, ~A~0.offset + 4 * ~i~0, 4); srcloc: null [2025-02-08 14:10:03,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-4: plus_~b#1 := plus_#in~b#1; [2025-02-08 14:10:03,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-5: plus_~a#1 := plus_#in~a#1; [2025-02-08 14:10:03,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-10: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short34#1; [2025-02-08 14:10:03,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-11: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-12: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-13: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,491 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-14: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_#t~short34#1 then 1 else 0); [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-15: assume -2147483648 - plus_~b#1 <= 9223372036854775807; [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-15: assume !(-2147483648 - plus_~b#1 <= 9223372036854775807); [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-16: plus_#t~short34#1 := plus_~a#1 >= -2147483648 - plus_~b#1; [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-17: assume -2147483648 - plus_~b#1 >= -9223372036854775808; [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-17: assume !(-2147483648 - plus_~b#1 >= -9223372036854775808); [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-18: assume plus_#t~short34#1; [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-18: assume !plus_#t~short34#1; [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-19: plus_#t~short34#1 := plus_~b#1 >= 0; [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-20: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short34#1; [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-21: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-22: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-23: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-24: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_#t~short34#1 then 1 else 0); [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-25: assume -2147483648 - plus_~b#1 <= 9223372036854775807; [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-25: assume !(-2147483648 - plus_~b#1 <= 9223372036854775807); [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-26: plus_#t~short34#1 := plus_~a#1 >= -2147483648 - plus_~b#1; [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-27: assume -2147483648 - plus_~b#1 >= -9223372036854775808; [2025-02-08 14:10:03,492 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-27: assume !(-2147483648 - plus_~b#1 >= -9223372036854775808); [2025-02-08 14:10:03,494 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-28: assume plus_#t~short34#1; [2025-02-08 14:10:03,494 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-28: assume !plus_#t~short34#1; [2025-02-08 14:10:03,494 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-29: plus_#t~short34#1 := plus_~b#1 >= 0; [2025-02-08 14:10:03,494 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-10: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short35#1; [2025-02-08 14:10:03,495 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-11: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,495 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-12: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,495 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-13: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,495 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-14: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_#t~short35#1 then 1 else 0); [2025-02-08 14:10:03,495 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-15: assume 2147483647 - plus_~b#1 <= 2147483647; [2025-02-08 14:10:03,495 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-15: assume !(2147483647 - plus_~b#1 <= 2147483647); [2025-02-08 14:10:03,495 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-16: plus_#t~short35#1 := plus_~a#1 <= 2147483647 - plus_~b#1; [2025-02-08 14:10:03,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-17: assume 2147483647 - plus_~b#1 >= -2147483648; [2025-02-08 14:10:03,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-17: assume !(2147483647 - plus_~b#1 >= -2147483648); [2025-02-08 14:10:03,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-18: assume plus_#t~short35#1; [2025-02-08 14:10:03,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-18: assume !plus_#t~short35#1; [2025-02-08 14:10:03,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-19: plus_#t~short35#1 := plus_~b#1 <= 0; [2025-02-08 14:10:03,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-20: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short35#1; [2025-02-08 14:10:03,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-21: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-22: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-23: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-24: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_#t~short35#1 then 1 else 0); [2025-02-08 14:10:03,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-25: assume 2147483647 - plus_~b#1 <= 2147483647; [2025-02-08 14:10:03,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-25: assume !(2147483647 - plus_~b#1 <= 2147483647); [2025-02-08 14:10:03,496 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-26: plus_#t~short35#1 := plus_~a#1 <= 2147483647 - plus_~b#1; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-27: assume 2147483647 - plus_~b#1 >= -2147483648; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-27: assume !(2147483647 - plus_~b#1 >= -2147483648); [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-28: assume plus_#t~short35#1; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-28: assume !plus_#t~short35#1; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-29: plus_#t~short35#1 := plus_~b#1 <= 0; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~post7#1; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: assume 1 + #t~post7#1 <= 2147483647; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: assume !(1 + #t~post7#1 <= 2147483647); [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: ~i~0 := 1 + #t~post7#1; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-4: assume plus_~a#1 + plus_~b#1 <= 2147483647; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-4: assume !(plus_~a#1 + plus_~b#1 <= 2147483647); [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-3: assume 1 + #t~post7#1 >= -2147483648; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-3: assume !(1 + #t~post7#1 >= -2147483648); [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-5: plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-4: #t~post7#1 := ~i~0; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-6: assume plus_~a#1 + plus_~b#1 >= -2147483648; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-6: assume !(plus_~a#1 + plus_~b#1 >= -2147483648); [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-8: assume plus_~a#1 + plus_~b#1 <= 2147483647; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-8: assume !(plus_~a#1 + plus_~b#1 <= 2147483647); [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-9: plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-10: assume plus_~a#1 + plus_~b#1 >= -2147483648; [2025-02-08 14:10:03,497 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-10: assume !(plus_~a#1 + plus_~b#1 >= -2147483648); [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47: havoc #t~ret2#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-1: havoc #t~ret2#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: assume #t~ret2#1 < ~cap1~0; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: assume !(#t~ret2#1 < ~cap1~0); [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-3: havoc #t~mem1#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-4: havoc #t~mem1#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-7: havoc plus_#t~short34#1, plus_#t~short35#1, plus_~a#1, plus_~b#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-8: #t~ret2#1 := plus_#res#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48: havoc #t~ret4#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-1: havoc #t~mem3#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: ~bag1~0 := #t~ret4#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-5: havoc plus_#t~short34#1, plus_#t~short35#1, plus_~a#1, plus_~b#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-6: #t~ret4#1 := plus_#res#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-7: havoc plus_#t~short34#1, plus_#t~short35#1, plus_~a#1, plus_~b#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-8: havoc plus_#res#1; [2025-02-08 14:10:03,498 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-9: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~bag1~0, #t~mem3#1; [2025-02-08 14:10:03,500 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-10: SUMMARY for call #t~mem3#1 := read~int#1(~A~0.base, ~A~0.offset + 4 * ~i~0, 4); srcloc: null [2025-02-08 14:10:03,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-4: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-5: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69: havoc #t~ret13#1; [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-1: ~sum2~0 := #t~ret13#1; [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-2: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret13#1 && #t~ret13#1 <= 2147483647; [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-3: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-4: havoc plus_#t~short34#1, plus_#t~short35#1, plus_~a#1, plus_~b#1; [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-4: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-4: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-5: #t~ret13#1 := plus_#res#1; [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-5: assume false; [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-6: havoc plus_#t~short34#1, plus_#t~short35#1, plus_~a#1, plus_~b#1; [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-6: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-6: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:10:03,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-7: havoc plus_#res#1; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-7: assume false; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-8: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~sum2~0, ~bag2~0; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-8: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-8: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-9: assume false; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-10: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-10: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-11: assume false; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-2: plus_~b#1 := plus_#in~b#1; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-3: plus_~a#1 := plus_#in~a#1; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-4: plus_~b#1 := plus_#in~b#1; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-5: plus_~a#1 := plus_#in~a#1; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc #t~mem14#1; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: ~bag2~0 := #t~mem14#1; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: SUMMARY for call #t~mem14#1 := read~int#1(~A~0.base, ~A~0.offset + 4 * ~j~0, 4); srcloc: null [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-10: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short34#1; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-11: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-12: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-13: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-14: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_#t~short34#1 then 1 else 0); [2025-02-08 14:10:03,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-15: assume -2147483648 - plus_~b#1 <= 9223372036854775807; [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-15: assume !(-2147483648 - plus_~b#1 <= 9223372036854775807); [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-16: plus_#t~short34#1 := plus_~a#1 >= -2147483648 - plus_~b#1; [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-17: assume -2147483648 - plus_~b#1 >= -9223372036854775808; [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-17: assume !(-2147483648 - plus_~b#1 >= -9223372036854775808); [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-18: assume plus_#t~short34#1; [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-18: assume !plus_#t~short34#1; [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-19: plus_#t~short34#1 := plus_~b#1 >= 0; [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-20: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short34#1; [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-21: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-22: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-23: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-24: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_#t~short34#1 then 1 else 0); [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-25: assume -2147483648 - plus_~b#1 <= 9223372036854775807; [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-25: assume !(-2147483648 - plus_~b#1 <= 9223372036854775807); [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-26: plus_#t~short34#1 := plus_~a#1 >= -2147483648 - plus_~b#1; [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-27: assume -2147483648 - plus_~b#1 >= -9223372036854775808; [2025-02-08 14:10:03,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-27: assume !(-2147483648 - plus_~b#1 >= -9223372036854775808); [2025-02-08 14:10:03,719 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-28: assume plus_#t~short34#1; [2025-02-08 14:10:03,719 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-28: assume !plus_#t~short34#1; [2025-02-08 14:10:03,720 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L120-29: plus_#t~short34#1 := plus_~b#1 >= 0; [2025-02-08 14:10:03,720 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-10: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short35#1; [2025-02-08 14:10:03,720 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-11: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,720 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-12: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,720 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-13: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,720 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-14: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_#t~short35#1 then 1 else 0); [2025-02-08 14:10:03,720 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-15: assume 2147483647 - plus_~b#1 <= 2147483647; [2025-02-08 14:10:03,720 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-15: assume !(2147483647 - plus_~b#1 <= 2147483647); [2025-02-08 14:10:03,720 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-16: plus_#t~short35#1 := plus_~a#1 <= 2147483647 - plus_~b#1; [2025-02-08 14:10:03,720 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-17: assume 2147483647 - plus_~b#1 >= -2147483648; [2025-02-08 14:10:03,720 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-17: assume !(2147483647 - plus_~b#1 >= -2147483648); [2025-02-08 14:10:03,720 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-18: assume plus_#t~short35#1; [2025-02-08 14:10:03,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-18: assume !plus_#t~short35#1; [2025-02-08 14:10:03,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-19: plus_#t~short35#1 := plus_~b#1 <= 0; [2025-02-08 14:10:03,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-20: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short35#1; [2025-02-08 14:10:03,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-21: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:10:03,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-22: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-23: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:10:03,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-24: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_#t~short35#1 then 1 else 0); [2025-02-08 14:10:03,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-25: assume 2147483647 - plus_~b#1 <= 2147483647; [2025-02-08 14:10:03,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-25: assume !(2147483647 - plus_~b#1 <= 2147483647); [2025-02-08 14:10:03,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-26: plus_#t~short35#1 := plus_~a#1 <= 2147483647 - plus_~b#1; [2025-02-08 14:10:03,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-27: assume 2147483647 - plus_~b#1 >= -2147483648; [2025-02-08 14:10:03,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-27: assume !(2147483647 - plus_~b#1 >= -2147483648); [2025-02-08 14:10:03,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-28: assume plus_#t~short35#1; [2025-02-08 14:10:03,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-28: assume !plus_#t~short35#1; [2025-02-08 14:10:03,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L121-29: plus_#t~short35#1 := plus_~b#1 <= 0; [2025-02-08 14:10:03,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-4: assume plus_~a#1 + plus_~b#1 <= 2147483647; [2025-02-08 14:10:03,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-4: assume !(plus_~a#1 + plus_~b#1 <= 2147483647); [2025-02-08 14:10:03,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-5: plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 14:10:03,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-6: assume plus_~a#1 + plus_~b#1 >= -2147483648; [2025-02-08 14:10:03,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-6: assume !(plus_~a#1 + plus_~b#1 >= -2147483648); [2025-02-08 14:10:03,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-8: assume plus_~a#1 + plus_~b#1 <= 2147483647; [2025-02-08 14:10:03,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-8: assume !(plus_~a#1 + plus_~b#1 <= 2147483647); [2025-02-08 14:10:03,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-9: plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 14:10:03,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-10: assume plus_~a#1 + plus_~b#1 >= -2147483648; [2025-02-08 14:10:03,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L122-10: assume !(plus_~a#1 + plus_~b#1 >= -2147483648); [2025-02-08 14:10:03,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: havoc #t~post15#1; [2025-02-08 14:10:03,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-1: assume 1 + #t~post15#1 <= 2147483647; [2025-02-08 14:10:03,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-1: assume !(1 + #t~post15#1 <= 2147483647); [2025-02-08 14:10:03,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-2: ~j~0 := 1 + #t~post15#1; [2025-02-08 14:10:03,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-3: assume 1 + #t~post15#1 >= -2147483648; [2025-02-08 14:10:03,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-3: assume !(1 + #t~post15#1 >= -2147483648); [2025-02-08 14:10:03,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73-4: #t~post15#1 := ~j~0; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64: havoc #t~ret10#1; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-1: havoc #t~ret10#1; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: assume #t~ret10#1 < ~cap2~0; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: assume !(#t~ret10#1 < ~cap2~0); [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-3: havoc #t~mem9#1; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-4: havoc #t~mem9#1; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-7: havoc plus_#t~short34#1, plus_#t~short35#1, plus_~a#1, plus_~b#1; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-8: #t~ret10#1 := plus_#res#1; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: havoc #t~ret12#1; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-1: havoc #t~mem11#1; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-2: ~bag2~0 := #t~ret12#1; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret12#1 && #t~ret12#1 <= 2147483647; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-5: havoc plus_#t~short34#1, plus_#t~short35#1, plus_~a#1, plus_~b#1; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-6: #t~ret12#1 := plus_#res#1; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-7: havoc plus_#t~short34#1, plus_#t~short35#1, plus_~a#1, plus_~b#1; [2025-02-08 14:10:03,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-8: havoc plus_#res#1; [2025-02-08 14:10:03,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-9: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~bag2~0, #t~mem11#1; [2025-02-08 14:10:03,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-10: SUMMARY for call #t~mem11#1 := read~int#1(~A~0.base, ~A~0.offset + 4 * ~j~0, 4); srcloc: null [2025-02-08 14:10:03,842 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:10:03,843 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:10:04,090 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:10:04,090 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:10:04,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:10:04 BoogieIcfgContainer [2025-02-08 14:10:04,091 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:10:04,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:10:04,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:10:04,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:10:04,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:10:02" (1/3) ... [2025-02-08 14:10:04,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682ae0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:10:04, skipping insertion in model container [2025-02-08 14:10:04,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:10:02" (2/3) ... [2025-02-08 14:10:04,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682ae0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:10:04, skipping insertion in model container [2025-02-08 14:10:04,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:10:04" (3/3) ... [2025-02-08 14:10:04,102 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-02-08 14:10:04,120 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:10:04,122 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-1.wvr.c that has 3 procedures, 86 locations, 1 initial locations, 3 loop locations, and 54 error locations. [2025-02-08 14:10:04,122 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:10:04,201 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:10:04,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 94 transitions, 202 flow [2025-02-08 14:10:04,283 INFO L124 PetriNetUnfolderBase]: 9/92 cut-off events. [2025-02-08 14:10:04,287 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 14:10:04,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 92 events. 9/92 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 399 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2025-02-08 14:10:04,294 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 94 transitions, 202 flow [2025-02-08 14:10:04,298 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 90 transitions, 189 flow [2025-02-08 14:10:04,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:10:04,326 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;@6409311, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:10:04,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-08 14:10:04,329 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:10:04,329 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 14:10:04,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:10:04,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:04,330 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 14:10:04,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:04,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:04,337 INFO L85 PathProgramCache]: Analyzing trace with hash 919126, now seen corresponding path program 1 times [2025-02-08 14:10:04,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:04,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913886006] [2025-02-08 14:10:04,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:04,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:04,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:10:04,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:10:04,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:04,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:04,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:04,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913886006] [2025-02-08 14:10:04,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913886006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:04,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:04,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:10:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000921248] [2025-02-08 14:10:04,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:04,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:04,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:04,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:04,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:04,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 94 [2025-02-08 14:10:04,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 90 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 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-02-08 14:10:04,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:04,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 94 [2025-02-08 14:10:04,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:04,945 INFO L124 PetriNetUnfolderBase]: 594/1302 cut-off events. [2025-02-08 14:10:04,945 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 14:10:04,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 1302 events. 594/1302 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9646 event pairs, 388 based on Foata normal form. 1/960 useless extension candidates. Maximal degree in co-relation 2170. Up to 921 conditions per place. [2025-02-08 14:10:04,957 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 34 selfloop transitions, 4 changer transitions 0/93 dead transitions. [2025-02-08 14:10:04,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 93 transitions, 271 flow [2025-02-08 14:10:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 268 transitions. [2025-02-08 14:10:04,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7127659574468085 [2025-02-08 14:10:04,974 INFO L175 Difference]: Start difference. First operand has 88 places, 90 transitions, 189 flow. Second operand 4 states and 268 transitions. [2025-02-08 14:10:04,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 93 transitions, 271 flow [2025-02-08 14:10:04,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 93 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:10:04,985 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 213 flow [2025-02-08 14:10:04,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=90, PETRI_TRANSITIONS=93} [2025-02-08 14:10:04,992 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 2 predicate places. [2025-02-08 14:10:04,992 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 213 flow [2025-02-08 14:10:04,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 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-02-08 14:10:04,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:04,993 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 14:10:04,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:10:04,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:04,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:04,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1612735551, now seen corresponding path program 1 times [2025-02-08 14:10:04,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:04,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939697398] [2025-02-08 14:10:04,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:04,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:05,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:10:05,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:10:05,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:05,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:05,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:05,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939697398] [2025-02-08 14:10:05,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939697398] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:10:05,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871561421] [2025-02-08 14:10:05,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:05,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:10:05,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:10:05,179 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-02-08 14:10:05,180 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-02-08 14:10:05,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:10:05,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:10:05,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:05,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:05,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:10:05,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:10:05,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:05,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:10:05,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871561421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:05,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:10:05,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 14:10:05,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213141392] [2025-02-08 14:10:05,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:05,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:10:05,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:05,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:10:05,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:10:05,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 94 [2025-02-08 14:10:05,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 57.833333333333336) internal successors, (347), 6 states have internal predecessors, (347), 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-02-08 14:10:05,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:05,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 94 [2025-02-08 14:10:05,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:05,603 INFO L124 PetriNetUnfolderBase]: 594/1301 cut-off events. [2025-02-08 14:10:05,603 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:10:05,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2265 conditions, 1301 events. 594/1301 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9652 event pairs, 388 based on Foata normal form. 1/960 useless extension candidates. Maximal degree in co-relation 2238. Up to 916 conditions per place. [2025-02-08 14:10:05,612 INFO L140 encePairwiseOnDemand]: 89/94 looper letters, 30 selfloop transitions, 7 changer transitions 0/92 dead transitions. [2025-02-08 14:10:05,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 283 flow [2025-02-08 14:10:05,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:10:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:10:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 380 transitions. [2025-02-08 14:10:05,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6737588652482269 [2025-02-08 14:10:05,615 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 213 flow. Second operand 6 states and 380 transitions. [2025-02-08 14:10:05,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 283 flow [2025-02-08 14:10:05,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:10:05,617 INFO L231 Difference]: Finished difference. Result has 93 places, 92 transitions, 220 flow [2025-02-08 14:10:05,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=93, PETRI_TRANSITIONS=92} [2025-02-08 14:10:05,618 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2025-02-08 14:10:05,618 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 92 transitions, 220 flow [2025-02-08 14:10:05,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.833333333333336) internal successors, (347), 6 states have internal predecessors, (347), 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-02-08 14:10:05,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:05,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:05,627 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-02-08 14:10:05,819 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-02-08 14:10:05,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:05,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1363691810, now seen corresponding path program 1 times [2025-02-08 14:10:05,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:05,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83286279] [2025-02-08 14:10:05,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:05,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:10:05,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:10:05,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:05,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:05,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83286279] [2025-02-08 14:10:05,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83286279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:05,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:05,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:05,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339363847] [2025-02-08 14:10:05,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:05,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:05,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:05,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:05,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:05,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 94 [2025-02-08 14:10:05,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 92 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 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-02-08 14:10:05,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:05,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 94 [2025-02-08 14:10:05,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:06,371 INFO L124 PetriNetUnfolderBase]: 1345/2806 cut-off events. [2025-02-08 14:10:06,372 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 14:10:06,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4985 conditions, 2806 events. 1345/2806 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 22872 event pairs, 336 based on Foata normal form. 112/2321 useless extension candidates. Maximal degree in co-relation 4955. Up to 1023 conditions per place. [2025-02-08 14:10:06,392 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 75 selfloop transitions, 9 changer transitions 0/128 dead transitions. [2025-02-08 14:10:06,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 128 transitions, 464 flow [2025-02-08 14:10:06,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2025-02-08 14:10:06,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7313829787234043 [2025-02-08 14:10:06,395 INFO L175 Difference]: Start difference. First operand has 93 places, 92 transitions, 220 flow. Second operand 4 states and 275 transitions. [2025-02-08 14:10:06,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 128 transitions, 464 flow [2025-02-08 14:10:06,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 128 transitions, 442 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-02-08 14:10:06,400 INFO L231 Difference]: Finished difference. Result has 92 places, 95 transitions, 258 flow [2025-02-08 14:10:06,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=92, PETRI_TRANSITIONS=95} [2025-02-08 14:10:06,402 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 4 predicate places. [2025-02-08 14:10:06,402 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 95 transitions, 258 flow [2025-02-08 14:10:06,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 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-02-08 14:10:06,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:06,403 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 14:10:06,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:10:06,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:06,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:06,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1544804610, now seen corresponding path program 1 times [2025-02-08 14:10:06,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:06,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210561572] [2025-02-08 14:10:06,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:06,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:06,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:10:06,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:10:06,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:06,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:06,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:06,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210561572] [2025-02-08 14:10:06,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210561572] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:10:06,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020024859] [2025-02-08 14:10:06,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:06,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:10:06,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:10:06,522 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-02-08 14:10:06,524 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-02-08 14:10:06,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:10:06,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:10:06,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:06,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:06,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:10:06,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:10:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:06,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:10:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:06,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020024859] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:10:06,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:10:06,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-08 14:10:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468588152] [2025-02-08 14:10:06,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:10:06,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:10:06,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:06,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:10:06,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:10:06,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 94 [2025-02-08 14:10:06,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 95 transitions, 258 flow. Second operand has 12 states, 12 states have (on average 58.083333333333336) internal successors, (697), 12 states have internal predecessors, (697), 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-02-08 14:10:06,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:06,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 94 [2025-02-08 14:10:06,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:07,067 INFO L124 PetriNetUnfolderBase]: 808/1998 cut-off events. [2025-02-08 14:10:07,068 INFO L125 PetriNetUnfolderBase]: For 441/527 co-relation queries the response was YES. [2025-02-08 14:10:07,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3759 conditions, 1998 events. 808/1998 cut-off events. For 441/527 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 17022 event pairs, 577 based on Foata normal form. 47/1577 useless extension candidates. Maximal degree in co-relation 3707. Up to 1274 conditions per place. [2025-02-08 14:10:07,084 INFO L140 encePairwiseOnDemand]: 89/94 looper letters, 36 selfloop transitions, 13 changer transitions 0/104 dead transitions. [2025-02-08 14:10:07,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 104 transitions, 386 flow [2025-02-08 14:10:07,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:10:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:10:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 619 transitions. [2025-02-08 14:10:07,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6585106382978724 [2025-02-08 14:10:07,087 INFO L175 Difference]: Start difference. First operand has 92 places, 95 transitions, 258 flow. Second operand 10 states and 619 transitions. [2025-02-08 14:10:07,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 104 transitions, 386 flow [2025-02-08 14:10:07,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 104 transitions, 386 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:10:07,093 INFO L231 Difference]: Finished difference. Result has 104 places, 104 transitions, 332 flow [2025-02-08 14:10:07,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=332, PETRI_PLACES=104, PETRI_TRANSITIONS=104} [2025-02-08 14:10:07,094 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 16 predicate places. [2025-02-08 14:10:07,094 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 104 transitions, 332 flow [2025-02-08 14:10:07,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 58.083333333333336) internal successors, (697), 12 states have internal predecessors, (697), 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-02-08 14:10:07,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:07,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:07,103 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-02-08 14:10:07,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:10:07,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:07,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash 675227760, now seen corresponding path program 1 times [2025-02-08 14:10:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:07,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950715499] [2025-02-08 14:10:07,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:07,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:07,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:10:07,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:10:07,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:07,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:07,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:07,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950715499] [2025-02-08 14:10:07,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950715499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:07,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:07,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:07,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846973395] [2025-02-08 14:10:07,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:07,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:07,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:07,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:07,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:07,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 94 [2025-02-08 14:10:07,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 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-02-08 14:10:07,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:07,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 94 [2025-02-08 14:10:07,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:07,775 INFO L124 PetriNetUnfolderBase]: 1091/2512 cut-off events. [2025-02-08 14:10:07,775 INFO L125 PetriNetUnfolderBase]: For 720/750 co-relation queries the response was YES. [2025-02-08 14:10:07,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4891 conditions, 2512 events. 1091/2512 cut-off events. For 720/750 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 21129 event pairs, 437 based on Foata normal form. 86/2139 useless extension candidates. Maximal degree in co-relation 4854. Up to 861 conditions per place. [2025-02-08 14:10:07,797 INFO L140 encePairwiseOnDemand]: 87/94 looper letters, 60 selfloop transitions, 10 changer transitions 0/118 dead transitions. [2025-02-08 14:10:07,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 118 transitions, 496 flow [2025-02-08 14:10:07,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2025-02-08 14:10:07,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6914893617021277 [2025-02-08 14:10:07,798 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 332 flow. Second operand 4 states and 260 transitions. [2025-02-08 14:10:07,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 118 transitions, 496 flow [2025-02-08 14:10:07,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 118 transitions, 485 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 14:10:07,809 INFO L231 Difference]: Finished difference. Result has 103 places, 101 transitions, 329 flow [2025-02-08 14:10:07,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=329, PETRI_PLACES=103, PETRI_TRANSITIONS=101} [2025-02-08 14:10:07,810 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 15 predicate places. [2025-02-08 14:10:07,810 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 101 transitions, 329 flow [2025-02-08 14:10:07,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 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-02-08 14:10:07,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:07,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:07,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:10:07,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:07,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:07,812 INFO L85 PathProgramCache]: Analyzing trace with hash 675259570, now seen corresponding path program 1 times [2025-02-08 14:10:07,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:07,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672135632] [2025-02-08 14:10:07,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:07,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:07,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:10:07,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:10:07,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:07,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:07,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:07,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672135632] [2025-02-08 14:10:07,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672135632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:07,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:07,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:07,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713150930] [2025-02-08 14:10:07,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:07,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:07,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:07,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:07,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:07,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 94 [2025-02-08 14:10:07,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 101 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-02-08 14:10:07,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:07,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 94 [2025-02-08 14:10:07,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:08,259 INFO L124 PetriNetUnfolderBase]: 913/2260 cut-off events. [2025-02-08 14:10:08,259 INFO L125 PetriNetUnfolderBase]: For 986/1072 co-relation queries the response was YES. [2025-02-08 14:10:08,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4389 conditions, 2260 events. 913/2260 cut-off events. For 986/1072 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19172 event pairs, 660 based on Foata normal form. 67/1847 useless extension candidates. Maximal degree in co-relation 4351. Up to 799 conditions per place. [2025-02-08 14:10:08,275 INFO L140 encePairwiseOnDemand]: 89/94 looper letters, 61 selfloop transitions, 4 changer transitions 0/118 dead transitions. [2025-02-08 14:10:08,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 118 transitions, 502 flow [2025-02-08 14:10:08,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2025-02-08 14:10:08,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7712765957446809 [2025-02-08 14:10:08,277 INFO L175 Difference]: Start difference. First operand has 103 places, 101 transitions, 329 flow. Second operand 4 states and 290 transitions. [2025-02-08 14:10:08,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 118 transitions, 502 flow [2025-02-08 14:10:08,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 118 transitions, 480 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:10:08,286 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 332 flow [2025-02-08 14:10:08,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2025-02-08 14:10:08,287 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 17 predicate places. [2025-02-08 14:10:08,287 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 332 flow [2025-02-08 14:10:08,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-02-08 14:10:08,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:08,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:08,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:10:08,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:08,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:08,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1764002421, now seen corresponding path program 1 times [2025-02-08 14:10:08,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:08,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183975567] [2025-02-08 14:10:08,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:08,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:08,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:10:08,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:10:08,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:08,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:08,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:08,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183975567] [2025-02-08 14:10:08,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183975567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:08,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:08,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:08,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578842070] [2025-02-08 14:10:08,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:08,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:08,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:08,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:08,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:08,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 94 [2025-02-08 14:10:08,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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-02-08 14:10:08,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:08,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 94 [2025-02-08 14:10:08,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:08,838 INFO L124 PetriNetUnfolderBase]: 1877/4038 cut-off events. [2025-02-08 14:10:08,838 INFO L125 PetriNetUnfolderBase]: For 2067/2281 co-relation queries the response was YES. [2025-02-08 14:10:08,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8320 conditions, 4038 events. 1877/4038 cut-off events. For 2067/2281 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 34731 event pairs, 533 based on Foata normal form. 264/3577 useless extension candidates. Maximal degree in co-relation 8282. Up to 1391 conditions per place. [2025-02-08 14:10:08,868 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 94 selfloop transitions, 9 changer transitions 0/144 dead transitions. [2025-02-08 14:10:08,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 144 transitions, 708 flow [2025-02-08 14:10:08,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 273 transitions. [2025-02-08 14:10:08,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.726063829787234 [2025-02-08 14:10:08,870 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 332 flow. Second operand 4 states and 273 transitions. [2025-02-08 14:10:08,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 144 transitions, 708 flow [2025-02-08 14:10:08,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 144 transitions, 705 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:10:08,876 INFO L231 Difference]: Finished difference. Result has 108 places, 105 transitions, 389 flow [2025-02-08 14:10:08,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=108, PETRI_TRANSITIONS=105} [2025-02-08 14:10:08,877 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 20 predicate places. [2025-02-08 14:10:08,877 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 389 flow [2025-02-08 14:10:08,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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-02-08 14:10:08,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:08,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:08,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:10:08,877 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:08,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:08,878 INFO L85 PathProgramCache]: Analyzing trace with hash -542805754, now seen corresponding path program 1 times [2025-02-08 14:10:08,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:08,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328609320] [2025-02-08 14:10:08,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:08,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:08,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:10:08,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:10:08,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:08,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:08,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:08,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328609320] [2025-02-08 14:10:08,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328609320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:08,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:08,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:08,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630239890] [2025-02-08 14:10:08,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:08,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:08,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:08,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:08,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:08,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 94 [2025-02-08 14:10:08,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 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-02-08 14:10:08,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:08,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 94 [2025-02-08 14:10:08,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:09,318 INFO L124 PetriNetUnfolderBase]: 1398/3524 cut-off events. [2025-02-08 14:10:09,318 INFO L125 PetriNetUnfolderBase]: For 2253/2389 co-relation queries the response was YES. [2025-02-08 14:10:09,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7604 conditions, 3524 events. 1398/3524 cut-off events. For 2253/2389 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 32477 event pairs, 686 based on Foata normal form. 136/3107 useless extension candidates. Maximal degree in co-relation 7563. Up to 1259 conditions per place. [2025-02-08 14:10:09,343 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 62 selfloop transitions, 12 changer transitions 0/122 dead transitions. [2025-02-08 14:10:09,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 122 transitions, 601 flow [2025-02-08 14:10:09,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 256 transitions. [2025-02-08 14:10:09,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6808510638297872 [2025-02-08 14:10:09,345 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 389 flow. Second operand 4 states and 256 transitions. [2025-02-08 14:10:09,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 122 transitions, 601 flow [2025-02-08 14:10:09,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 122 transitions, 601 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:10:09,355 INFO L231 Difference]: Finished difference. Result has 110 places, 104 transitions, 409 flow [2025-02-08 14:10:09,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=409, PETRI_PLACES=110, PETRI_TRANSITIONS=104} [2025-02-08 14:10:09,357 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 22 predicate places. [2025-02-08 14:10:09,358 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 104 transitions, 409 flow [2025-02-08 14:10:09,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 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-02-08 14:10:09,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:09,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:09,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:10:09,358 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:09,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:09,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1150498848, now seen corresponding path program 1 times [2025-02-08 14:10:09,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:09,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111604891] [2025-02-08 14:10:09,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:09,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:09,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:10:09,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:10:09,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:09,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:09,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:09,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111604891] [2025-02-08 14:10:09,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111604891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:09,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:09,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:09,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084028873] [2025-02-08 14:10:09,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:09,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:09,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:09,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:09,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:09,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 94 [2025-02-08 14:10:09,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 104 transitions, 409 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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-02-08 14:10:09,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:09,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 94 [2025-02-08 14:10:09,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:09,831 INFO L124 PetriNetUnfolderBase]: 1551/3860 cut-off events. [2025-02-08 14:10:09,832 INFO L125 PetriNetUnfolderBase]: For 3466/3614 co-relation queries the response was YES. [2025-02-08 14:10:09,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8594 conditions, 3860 events. 1551/3860 cut-off events. For 3466/3614 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 36385 event pairs, 643 based on Foata normal form. 181/3441 useless extension candidates. Maximal degree in co-relation 8551. Up to 1334 conditions per place. [2025-02-08 14:10:09,854 INFO L140 encePairwiseOnDemand]: 87/94 looper letters, 67 selfloop transitions, 10 changer transitions 0/121 dead transitions. [2025-02-08 14:10:09,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 121 transitions, 642 flow [2025-02-08 14:10:09,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2025-02-08 14:10:09,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6888297872340425 [2025-02-08 14:10:09,856 INFO L175 Difference]: Start difference. First operand has 110 places, 104 transitions, 409 flow. Second operand 4 states and 259 transitions. [2025-02-08 14:10:09,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 121 transitions, 642 flow [2025-02-08 14:10:09,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 121 transitions, 610 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:10:09,867 INFO L231 Difference]: Finished difference. Result has 108 places, 101 transitions, 393 flow [2025-02-08 14:10:09,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=393, PETRI_PLACES=108, PETRI_TRANSITIONS=101} [2025-02-08 14:10:09,868 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 20 predicate places. [2025-02-08 14:10:09,868 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 101 transitions, 393 flow [2025-02-08 14:10:09,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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-02-08 14:10:09,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:09,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:09,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:10:09,869 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:09,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1150467038, now seen corresponding path program 1 times [2025-02-08 14:10:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:09,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946261679] [2025-02-08 14:10:09,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:09,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:09,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:10:09,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:10:09,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:09,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:09,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:09,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946261679] [2025-02-08 14:10:09,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946261679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:09,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:09,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:09,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123250217] [2025-02-08 14:10:09,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:09,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:09,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:09,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:09,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:09,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 94 [2025-02-08 14:10:09,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 101 transitions, 393 flow. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 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-02-08 14:10:09,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:09,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 94 [2025-02-08 14:10:09,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:10,274 INFO L124 PetriNetUnfolderBase]: 1314/3391 cut-off events. [2025-02-08 14:10:10,275 INFO L125 PetriNetUnfolderBase]: For 2719/2862 co-relation queries the response was YES. [2025-02-08 14:10:10,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7413 conditions, 3391 events. 1314/3391 cut-off events. For 2719/2862 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 31673 event pairs, 909 based on Foata normal form. 116/2971 useless extension candidates. Maximal degree in co-relation 7370. Up to 1202 conditions per place. [2025-02-08 14:10:10,301 INFO L140 encePairwiseOnDemand]: 89/94 looper letters, 69 selfloop transitions, 4 changer transitions 0/122 dead transitions. [2025-02-08 14:10:10,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 122 transitions, 627 flow [2025-02-08 14:10:10,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 291 transitions. [2025-02-08 14:10:10,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.773936170212766 [2025-02-08 14:10:10,303 INFO L175 Difference]: Start difference. First operand has 108 places, 101 transitions, 393 flow. Second operand 4 states and 291 transitions. [2025-02-08 14:10:10,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 122 transitions, 627 flow [2025-02-08 14:10:10,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 122 transitions, 605 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:10:10,314 INFO L231 Difference]: Finished difference. Result has 110 places, 102 transitions, 396 flow [2025-02-08 14:10:10,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=396, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2025-02-08 14:10:10,315 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 22 predicate places. [2025-02-08 14:10:10,315 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 396 flow [2025-02-08 14:10:10,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 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-02-08 14:10:10,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:10,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:10,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:10:10,316 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:10,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:10,316 INFO L85 PathProgramCache]: Analyzing trace with hash 352890741, now seen corresponding path program 1 times [2025-02-08 14:10:10,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:10,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049452871] [2025-02-08 14:10:10,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:10,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:10,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:10:10,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:10:10,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:10,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:10,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049452871] [2025-02-08 14:10:10,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049452871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:10,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:10,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:10:10,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578679955] [2025-02-08 14:10:10,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:10,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:10:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:10,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:10:10,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:10:10,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 94 [2025-02-08 14:10:10,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 396 flow. Second operand has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 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-02-08 14:10:10,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:10,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 94 [2025-02-08 14:10:10,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:10,993 INFO L124 PetriNetUnfolderBase]: 1886/4268 cut-off events. [2025-02-08 14:10:10,993 INFO L125 PetriNetUnfolderBase]: For 3209/3394 co-relation queries the response was YES. [2025-02-08 14:10:11,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9693 conditions, 4268 events. 1886/4268 cut-off events. For 3209/3394 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 37630 event pairs, 913 based on Foata normal form. 139/3969 useless extension candidates. Maximal degree in co-relation 9650. Up to 1788 conditions per place. [2025-02-08 14:10:11,022 INFO L140 encePairwiseOnDemand]: 84/94 looper letters, 103 selfloop transitions, 15 changer transitions 3/162 dead transitions. [2025-02-08 14:10:11,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 162 transitions, 891 flow [2025-02-08 14:10:11,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:10:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:10:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 347 transitions. [2025-02-08 14:10:11,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7382978723404255 [2025-02-08 14:10:11,024 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 396 flow. Second operand 5 states and 347 transitions. [2025-02-08 14:10:11,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 162 transitions, 891 flow [2025-02-08 14:10:11,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 162 transitions, 888 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:10:11,034 INFO L231 Difference]: Finished difference. Result has 115 places, 103 transitions, 447 flow [2025-02-08 14:10:11,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=447, PETRI_PLACES=115, PETRI_TRANSITIONS=103} [2025-02-08 14:10:11,035 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 27 predicate places. [2025-02-08 14:10:11,035 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 103 transitions, 447 flow [2025-02-08 14:10:11,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 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-02-08 14:10:11,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:11,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:11,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:10:11,036 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:11,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1305755715, now seen corresponding path program 1 times [2025-02-08 14:10:11,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:11,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034034789] [2025-02-08 14:10:11,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:11,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:11,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:10:11,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:10:11,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:11,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:11,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:11,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034034789] [2025-02-08 14:10:11,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034034789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:11,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:11,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:11,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399915263] [2025-02-08 14:10:11,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:11,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:11,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:11,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:11,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:11,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 94 [2025-02-08 14:10:11,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 103 transitions, 447 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-02-08 14:10:11,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:11,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 94 [2025-02-08 14:10:11,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:11,460 INFO L124 PetriNetUnfolderBase]: 1430/3621 cut-off events. [2025-02-08 14:10:11,460 INFO L125 PetriNetUnfolderBase]: For 3914/4084 co-relation queries the response was YES. [2025-02-08 14:10:11,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8480 conditions, 3621 events. 1430/3621 cut-off events. For 3914/4084 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 33961 event pairs, 679 based on Foata normal form. 135/3242 useless extension candidates. Maximal degree in co-relation 8433. Up to 1368 conditions per place. [2025-02-08 14:10:11,484 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 63 selfloop transitions, 12 changer transitions 0/120 dead transitions. [2025-02-08 14:10:11,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 120 transitions, 691 flow [2025-02-08 14:10:11,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2025-02-08 14:10:11,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6781914893617021 [2025-02-08 14:10:11,486 INFO L175 Difference]: Start difference. First operand has 115 places, 103 transitions, 447 flow. Second operand 4 states and 255 transitions. [2025-02-08 14:10:11,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 120 transitions, 691 flow [2025-02-08 14:10:11,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 120 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:10:11,498 INFO L231 Difference]: Finished difference. Result has 115 places, 102 transitions, 455 flow [2025-02-08 14:10:11,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=455, PETRI_PLACES=115, PETRI_TRANSITIONS=102} [2025-02-08 14:10:11,500 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 27 predicate places. [2025-02-08 14:10:11,500 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 102 transitions, 455 flow [2025-02-08 14:10:11,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-02-08 14:10:11,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:11,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:11,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 14:10:11,501 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:11,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:11,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1136169065, now seen corresponding path program 1 times [2025-02-08 14:10:11,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:11,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312837730] [2025-02-08 14:10:11,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:11,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:11,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:10:11,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:10:11,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:11,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312837730] [2025-02-08 14:10:11,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312837730] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:10:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333753051] [2025-02-08 14:10:11,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:11,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:10:11,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:10:11,787 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-02-08 14:10:11,789 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-02-08 14:10:11,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:10:11,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:10:11,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:11,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:11,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 14:10:11,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:10:11,904 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-02-08 14:10:11,975 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-02-08 14:10:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:11,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:10:12,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-02-08 14:10:12,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-08 14:10:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:12,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333753051] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:10:12,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:10:12,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 14:10:12,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443883891] [2025-02-08 14:10:12,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:10:12,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 14:10:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:12,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 14:10:12,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-08 14:10:12,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 94 [2025-02-08 14:10:12,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 102 transitions, 455 flow. Second operand has 11 states, 11 states have (on average 54.54545454545455) internal successors, (600), 11 states have internal predecessors, (600), 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-02-08 14:10:12,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:12,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 94 [2025-02-08 14:10:12,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:12,871 INFO L124 PetriNetUnfolderBase]: 1653/4161 cut-off events. [2025-02-08 14:10:12,871 INFO L125 PetriNetUnfolderBase]: For 5007/5215 co-relation queries the response was YES. [2025-02-08 14:10:12,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10197 conditions, 4161 events. 1653/4161 cut-off events. For 5007/5215 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 39447 event pairs, 472 based on Foata normal form. 170/3912 useless extension candidates. Maximal degree in co-relation 10149. Up to 1118 conditions per place. [2025-02-08 14:10:12,908 INFO L140 encePairwiseOnDemand]: 85/94 looper letters, 120 selfloop transitions, 17 changer transitions 0/184 dead transitions. [2025-02-08 14:10:12,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 184 transitions, 1093 flow [2025-02-08 14:10:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:10:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:10:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 643 transitions. [2025-02-08 14:10:12,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6840425531914893 [2025-02-08 14:10:12,911 INFO L175 Difference]: Start difference. First operand has 115 places, 102 transitions, 455 flow. Second operand 10 states and 643 transitions. [2025-02-08 14:10:12,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 184 transitions, 1093 flow [2025-02-08 14:10:12,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 184 transitions, 1041 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:10:12,926 INFO L231 Difference]: Finished difference. Result has 122 places, 106 transitions, 504 flow [2025-02-08 14:10:12,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=504, PETRI_PLACES=122, PETRI_TRANSITIONS=106} [2025-02-08 14:10:12,927 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 34 predicate places. [2025-02-08 14:10:12,927 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 106 transitions, 504 flow [2025-02-08 14:10:12,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 54.54545454545455) internal successors, (600), 11 states have internal predecessors, (600), 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-02-08 14:10:12,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:12,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:12,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 14:10:13,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:10:13,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:13,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:13,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1945287987, now seen corresponding path program 1 times [2025-02-08 14:10:13,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:13,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950427132] [2025-02-08 14:10:13,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:13,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:13,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:10:13,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:10:13,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:13,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:13,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:13,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950427132] [2025-02-08 14:10:13,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950427132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:13,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:13,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:10:13,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348499070] [2025-02-08 14:10:13,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:13,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:10:13,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:13,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:10:13,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:10:13,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 94 [2025-02-08 14:10:13,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 106 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 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-02-08 14:10:13,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:13,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 94 [2025-02-08 14:10:13,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:13,974 INFO L124 PetriNetUnfolderBase]: 2808/5791 cut-off events. [2025-02-08 14:10:13,974 INFO L125 PetriNetUnfolderBase]: For 7773/8042 co-relation queries the response was YES. [2025-02-08 14:10:13,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14725 conditions, 5791 events. 2808/5791 cut-off events. For 7773/8042 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 51374 event pairs, 904 based on Foata normal form. 335/5625 useless extension candidates. Maximal degree in co-relation 14675. Up to 1684 conditions per place. [2025-02-08 14:10:14,013 INFO L140 encePairwiseOnDemand]: 84/94 looper letters, 160 selfloop transitions, 20 changer transitions 3/219 dead transitions. [2025-02-08 14:10:14,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 219 transitions, 1345 flow [2025-02-08 14:10:14,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:10:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:10:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 481 transitions. [2025-02-08 14:10:14,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6396276595744681 [2025-02-08 14:10:14,016 INFO L175 Difference]: Start difference. First operand has 122 places, 106 transitions, 504 flow. Second operand 8 states and 481 transitions. [2025-02-08 14:10:14,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 219 transitions, 1345 flow [2025-02-08 14:10:14,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 219 transitions, 1311 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-02-08 14:10:14,038 INFO L231 Difference]: Finished difference. Result has 125 places, 105 transitions, 510 flow [2025-02-08 14:10:14,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=510, PETRI_PLACES=125, PETRI_TRANSITIONS=105} [2025-02-08 14:10:14,039 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 37 predicate places. [2025-02-08 14:10:14,040 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 105 transitions, 510 flow [2025-02-08 14:10:14,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 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-02-08 14:10:14,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:14,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:14,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 14:10:14,040 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:14,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:14,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1823721531, now seen corresponding path program 1 times [2025-02-08 14:10:14,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:14,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433217182] [2025-02-08 14:10:14,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:14,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:14,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:10:14,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:10:14,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:14,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:14,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:14,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433217182] [2025-02-08 14:10:14,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433217182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:14,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:14,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:10:14,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924831775] [2025-02-08 14:10:14,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:14,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:10:14,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:14,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:10:14,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:10:14,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 94 [2025-02-08 14:10:14,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 105 transitions, 510 flow. Second operand has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 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-02-08 14:10:14,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:14,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 94 [2025-02-08 14:10:14,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:14,734 INFO L124 PetriNetUnfolderBase]: 2524/5674 cut-off events. [2025-02-08 14:10:14,735 INFO L125 PetriNetUnfolderBase]: For 9867/10124 co-relation queries the response was YES. [2025-02-08 14:10:14,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14969 conditions, 5674 events. 2524/5674 cut-off events. For 9867/10124 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 53688 event pairs, 1308 based on Foata normal form. 212/5547 useless extension candidates. Maximal degree in co-relation 14917. Up to 2395 conditions per place. [2025-02-08 14:10:14,770 INFO L140 encePairwiseOnDemand]: 84/94 looper letters, 115 selfloop transitions, 15 changer transitions 7/176 dead transitions. [2025-02-08 14:10:14,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 176 transitions, 1283 flow [2025-02-08 14:10:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:10:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:10:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 343 transitions. [2025-02-08 14:10:14,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7297872340425532 [2025-02-08 14:10:14,772 INFO L175 Difference]: Start difference. First operand has 125 places, 105 transitions, 510 flow. Second operand 5 states and 343 transitions. [2025-02-08 14:10:14,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 176 transitions, 1283 flow [2025-02-08 14:10:14,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 176 transitions, 1181 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 14:10:14,796 INFO L231 Difference]: Finished difference. Result has 125 places, 106 transitions, 528 flow [2025-02-08 14:10:14,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=528, PETRI_PLACES=125, PETRI_TRANSITIONS=106} [2025-02-08 14:10:14,797 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 37 predicate places. [2025-02-08 14:10:14,797 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 106 transitions, 528 flow [2025-02-08 14:10:14,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 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-02-08 14:10:14,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:14,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:14,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 14:10:14,797 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:14,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash 744087934, now seen corresponding path program 1 times [2025-02-08 14:10:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:14,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012387840] [2025-02-08 14:10:14,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:14,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:14,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:10:14,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:10:14,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:14,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:14,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:14,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012387840] [2025-02-08 14:10:14,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012387840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:14,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:14,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:14,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532921610] [2025-02-08 14:10:14,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:14,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:14,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:14,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:14,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:14,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 94 [2025-02-08 14:10:14,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 106 transitions, 528 flow. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:10:14,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:14,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 94 [2025-02-08 14:10:14,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:15,421 INFO L124 PetriNetUnfolderBase]: 2596/5591 cut-off events. [2025-02-08 14:10:15,421 INFO L125 PetriNetUnfolderBase]: For 7789/8068 co-relation queries the response was YES. [2025-02-08 14:10:15,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15142 conditions, 5591 events. 2596/5591 cut-off events. For 7789/8068 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 51342 event pairs, 1060 based on Foata normal form. 206/5470 useless extension candidates. Maximal degree in co-relation 15090. Up to 2077 conditions per place. [2025-02-08 14:10:15,459 INFO L140 encePairwiseOnDemand]: 85/94 looper letters, 98 selfloop transitions, 11 changer transitions 0/147 dead transitions. [2025-02-08 14:10:15,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 147 transitions, 952 flow [2025-02-08 14:10:15,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2025-02-08 14:10:15,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7340425531914894 [2025-02-08 14:10:15,461 INFO L175 Difference]: Start difference. First operand has 125 places, 106 transitions, 528 flow. Second operand 4 states and 276 transitions. [2025-02-08 14:10:15,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 147 transitions, 952 flow [2025-02-08 14:10:15,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 147 transitions, 925 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:10:15,487 INFO L231 Difference]: Finished difference. Result has 126 places, 107 transitions, 557 flow [2025-02-08 14:10:15,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=557, PETRI_PLACES=126, PETRI_TRANSITIONS=107} [2025-02-08 14:10:15,487 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 38 predicate places. [2025-02-08 14:10:15,488 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 107 transitions, 557 flow [2025-02-08 14:10:15,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:10:15,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:15,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:15,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 14:10:15,488 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:15,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:15,489 INFO L85 PathProgramCache]: Analyzing trace with hash 861472816, now seen corresponding path program 1 times [2025-02-08 14:10:15,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:15,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370294448] [2025-02-08 14:10:15,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:15,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:15,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:10:15,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:10:15,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:15,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:15,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:15,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370294448] [2025-02-08 14:10:15,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370294448] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:10:15,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395695518] [2025-02-08 14:10:15,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:15,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:10:15,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:10:15,709 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-02-08 14:10:15,712 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-02-08 14:10:15,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:10:15,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:10:15,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:15,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:15,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 14:10:15,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:10:15,793 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-02-08 14:10:15,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:10:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:15,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:10:15,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-08 14:10:15,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-02-08 14:10:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395695518] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:10:15,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:10:15,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 14:10:15,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50301179] [2025-02-08 14:10:15,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:10:15,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 14:10:15,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:15,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 14:10:15,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-08 14:10:16,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 94 [2025-02-08 14:10:16,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 107 transitions, 557 flow. Second operand has 11 states, 11 states have (on average 50.72727272727273) internal successors, (558), 11 states have internal predecessors, (558), 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-02-08 14:10:16,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:16,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 94 [2025-02-08 14:10:16,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:16,735 INFO L124 PetriNetUnfolderBase]: 2038/4757 cut-off events. [2025-02-08 14:10:16,736 INFO L125 PetriNetUnfolderBase]: For 8995/9274 co-relation queries the response was YES. [2025-02-08 14:10:16,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13131 conditions, 4757 events. 2038/4757 cut-off events. For 8995/9274 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 44469 event pairs, 979 based on Foata normal form. 218/4644 useless extension candidates. Maximal degree in co-relation 13079. Up to 1296 conditions per place. [2025-02-08 14:10:16,767 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 115 selfloop transitions, 13 changer transitions 0/172 dead transitions. [2025-02-08 14:10:16,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 172 transitions, 1120 flow [2025-02-08 14:10:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 14:10:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 14:10:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 542 transitions. [2025-02-08 14:10:16,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640661938534279 [2025-02-08 14:10:16,770 INFO L175 Difference]: Start difference. First operand has 126 places, 107 transitions, 557 flow. Second operand 9 states and 542 transitions. [2025-02-08 14:10:16,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 172 transitions, 1120 flow [2025-02-08 14:10:16,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 172 transitions, 1095 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 14:10:16,788 INFO L231 Difference]: Finished difference. Result has 131 places, 107 transitions, 561 flow [2025-02-08 14:10:16,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=561, PETRI_PLACES=131, PETRI_TRANSITIONS=107} [2025-02-08 14:10:16,789 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 43 predicate places. [2025-02-08 14:10:16,789 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 107 transitions, 561 flow [2025-02-08 14:10:16,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 50.72727272727273) internal successors, (558), 11 states have internal predecessors, (558), 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-02-08 14:10:16,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:16,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:16,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 14:10:16,993 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,SelfDestructingSolverStorable16 [2025-02-08 14:10:16,993 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:16,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash -700791644, now seen corresponding path program 1 times [2025-02-08 14:10:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285262661] [2025-02-08 14:10:16,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:16,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:17,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:10:17,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:10:17,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:17,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:17,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:17,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285262661] [2025-02-08 14:10:17,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285262661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:17,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:17,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:10:17,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235342851] [2025-02-08 14:10:17,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:17,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:10:17,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:17,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:10:17,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:10:17,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 94 [2025-02-08 14:10:17,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 107 transitions, 561 flow. Second operand has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 6 states have internal predecessors, (268), 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-02-08 14:10:17,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:17,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 94 [2025-02-08 14:10:17,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:17,754 INFO L124 PetriNetUnfolderBase]: 3085/6167 cut-off events. [2025-02-08 14:10:17,754 INFO L125 PetriNetUnfolderBase]: For 13930/14298 co-relation queries the response was YES. [2025-02-08 14:10:17,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17485 conditions, 6167 events. 3085/6167 cut-off events. For 13930/14298 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 54594 event pairs, 1052 based on Foata normal form. 330/6173 useless extension candidates. Maximal degree in co-relation 17432. Up to 1980 conditions per place. [2025-02-08 14:10:17,776 INFO L140 encePairwiseOnDemand]: 84/94 looper letters, 173 selfloop transitions, 17 changer transitions 10/236 dead transitions. [2025-02-08 14:10:17,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 236 transitions, 1809 flow [2025-02-08 14:10:17,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 14:10:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 14:10:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 475 transitions. [2025-02-08 14:10:17,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6316489361702128 [2025-02-08 14:10:17,779 INFO L175 Difference]: Start difference. First operand has 131 places, 107 transitions, 561 flow. Second operand 8 states and 475 transitions. [2025-02-08 14:10:17,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 236 transitions, 1809 flow [2025-02-08 14:10:17,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 236 transitions, 1793 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:10:17,806 INFO L231 Difference]: Finished difference. Result has 135 places, 107 transitions, 590 flow [2025-02-08 14:10:17,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=590, PETRI_PLACES=135, PETRI_TRANSITIONS=107} [2025-02-08 14:10:17,807 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 47 predicate places. [2025-02-08 14:10:17,807 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 107 transitions, 590 flow [2025-02-08 14:10:17,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 6 states have internal predecessors, (268), 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-02-08 14:10:17,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:17,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:17,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 14:10:17,808 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:17,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1081322652, now seen corresponding path program 1 times [2025-02-08 14:10:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:17,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247472673] [2025-02-08 14:10:17,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:17,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:10:17,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:10:17,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:17,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:17,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:17,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247472673] [2025-02-08 14:10:17,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247472673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:17,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:17,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:17,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960272278] [2025-02-08 14:10:17,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:17,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:17,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:17,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:17,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:17,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 94 [2025-02-08 14:10:17,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 107 transitions, 590 flow. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:10:17,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:17,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 94 [2025-02-08 14:10:17,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:18,477 INFO L124 PetriNetUnfolderBase]: 2766/6052 cut-off events. [2025-02-08 14:10:18,477 INFO L125 PetriNetUnfolderBase]: For 13056/13363 co-relation queries the response was YES. [2025-02-08 14:10:18,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17770 conditions, 6052 events. 2766/6052 cut-off events. For 13056/13363 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 56926 event pairs, 1698 based on Foata normal form. 301/5981 useless extension candidates. Maximal degree in co-relation 17714. Up to 3096 conditions per place. [2025-02-08 14:10:18,511 INFO L140 encePairwiseOnDemand]: 85/94 looper letters, 101 selfloop transitions, 8 changer transitions 0/150 dead transitions. [2025-02-08 14:10:18,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 150 transitions, 1061 flow [2025-02-08 14:10:18,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:18,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:18,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2025-02-08 14:10:18,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7446808510638298 [2025-02-08 14:10:18,512 INFO L175 Difference]: Start difference. First operand has 135 places, 107 transitions, 590 flow. Second operand 4 states and 280 transitions. [2025-02-08 14:10:18,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 150 transitions, 1061 flow [2025-02-08 14:10:18,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 150 transitions, 996 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:10:18,537 INFO L231 Difference]: Finished difference. Result has 134 places, 110 transitions, 592 flow [2025-02-08 14:10:18,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=592, PETRI_PLACES=134, PETRI_TRANSITIONS=110} [2025-02-08 14:10:18,538 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 46 predicate places. [2025-02-08 14:10:18,538 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 110 transitions, 592 flow [2025-02-08 14:10:18,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:10:18,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:18,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:18,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 14:10:18,538 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:18,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:18,539 INFO L85 PathProgramCache]: Analyzing trace with hash -598073831, now seen corresponding path program 1 times [2025-02-08 14:10:18,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:18,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495193140] [2025-02-08 14:10:18,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:18,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:18,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:10:18,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:10:18,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:18,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495193140] [2025-02-08 14:10:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495193140] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:10:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025589997] [2025-02-08 14:10:18,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:18,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:10:18,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:10:18,744 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-02-08 14:10:18,746 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-02-08 14:10:18,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:10:18,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:10:18,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:18,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:18,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 14:10:18,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:10:18,826 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-02-08 14:10:18,895 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-02-08 14:10:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:18,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:10:18,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-02-08 14:10:18,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-08 14:10:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:18,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025589997] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:10:18,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:10:18,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 14:10:18,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167119661] [2025-02-08 14:10:18,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:10:18,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 14:10:18,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:18,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 14:10:18,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-08 14:10:19,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 94 [2025-02-08 14:10:19,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 110 transitions, 592 flow. Second operand has 11 states, 11 states have (on average 55.09090909090909) internal successors, (606), 11 states have internal predecessors, (606), 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-02-08 14:10:19,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:19,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 94 [2025-02-08 14:10:19,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:19,777 INFO L124 PetriNetUnfolderBase]: 1818/4474 cut-off events. [2025-02-08 14:10:19,777 INFO L125 PetriNetUnfolderBase]: For 10379/10856 co-relation queries the response was YES. [2025-02-08 14:10:19,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12963 conditions, 4474 events. 1818/4474 cut-off events. For 10379/10856 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 42597 event pairs, 524 based on Foata normal form. 387/4564 useless extension candidates. Maximal degree in co-relation 12908. Up to 1207 conditions per place. [2025-02-08 14:10:19,801 INFO L140 encePairwiseOnDemand]: 85/94 looper letters, 132 selfloop transitions, 15 changer transitions 4/197 dead transitions. [2025-02-08 14:10:19,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 197 transitions, 1414 flow [2025-02-08 14:10:19,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:10:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:10:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 639 transitions. [2025-02-08 14:10:19,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6797872340425531 [2025-02-08 14:10:19,803 INFO L175 Difference]: Start difference. First operand has 134 places, 110 transitions, 592 flow. Second operand 10 states and 639 transitions. [2025-02-08 14:10:19,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 197 transitions, 1414 flow [2025-02-08 14:10:19,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 197 transitions, 1414 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:10:19,834 INFO L231 Difference]: Finished difference. Result has 142 places, 111 transitions, 629 flow [2025-02-08 14:10:19,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=629, PETRI_PLACES=142, PETRI_TRANSITIONS=111} [2025-02-08 14:10:19,835 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 54 predicate places. [2025-02-08 14:10:19,835 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 111 transitions, 629 flow [2025-02-08 14:10:19,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 55.09090909090909) internal successors, (606), 11 states have internal predecessors, (606), 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-02-08 14:10:19,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:19,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:19,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 14:10:20,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:10:20,036 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:20,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:20,036 INFO L85 PathProgramCache]: Analyzing trace with hash 935854448, now seen corresponding path program 1 times [2025-02-08 14:10:20,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:20,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665776012] [2025-02-08 14:10:20,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:20,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:20,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:10:20,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:10:20,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:20,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:10:20,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:20,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665776012] [2025-02-08 14:10:20,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665776012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:20,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:20,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:20,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723639110] [2025-02-08 14:10:20,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:20,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:20,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:20,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:20,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:20,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 94 [2025-02-08 14:10:20,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 111 transitions, 629 flow. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:10:20,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:20,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 94 [2025-02-08 14:10:20,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:20,598 INFO L124 PetriNetUnfolderBase]: 2140/5007 cut-off events. [2025-02-08 14:10:20,598 INFO L125 PetriNetUnfolderBase]: For 11221/11439 co-relation queries the response was YES. [2025-02-08 14:10:20,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15220 conditions, 5007 events. 2140/5007 cut-off events. For 11221/11439 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 47103 event pairs, 598 based on Foata normal form. 174/5003 useless extension candidates. Maximal degree in co-relation 15163. Up to 1468 conditions per place. [2025-02-08 14:10:20,624 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 105 selfloop transitions, 11 changer transitions 0/157 dead transitions. [2025-02-08 14:10:20,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 157 transitions, 1144 flow [2025-02-08 14:10:20,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 263 transitions. [2025-02-08 14:10:20,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.699468085106383 [2025-02-08 14:10:20,626 INFO L175 Difference]: Start difference. First operand has 142 places, 111 transitions, 629 flow. Second operand 4 states and 263 transitions. [2025-02-08 14:10:20,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 157 transitions, 1144 flow [2025-02-08 14:10:20,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 157 transitions, 1090 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:10:20,682 INFO L231 Difference]: Finished difference. Result has 139 places, 110 transitions, 610 flow [2025-02-08 14:10:20,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=610, PETRI_PLACES=139, PETRI_TRANSITIONS=110} [2025-02-08 14:10:20,683 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 51 predicate places. [2025-02-08 14:10:20,683 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 110 transitions, 610 flow [2025-02-08 14:10:20,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:10:20,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:20,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:20,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 14:10:20,684 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:20,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:20,684 INFO L85 PathProgramCache]: Analyzing trace with hash 935853455, now seen corresponding path program 1 times [2025-02-08 14:10:20,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:20,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675067575] [2025-02-08 14:10:20,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:20,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:20,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:10:20,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:10:20,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:20,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:10:20,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:20,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675067575] [2025-02-08 14:10:20,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675067575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:20,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:20,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:10:20,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912617698] [2025-02-08 14:10:20,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:20,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:10:20,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:20,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:10:20,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:10:20,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 94 [2025-02-08 14:10:20,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 110 transitions, 610 flow. Second operand has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 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-02-08 14:10:20,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:20,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 94 [2025-02-08 14:10:20,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:21,293 INFO L124 PetriNetUnfolderBase]: 2161/5057 cut-off events. [2025-02-08 14:10:21,294 INFO L125 PetriNetUnfolderBase]: For 11707/11936 co-relation queries the response was YES. [2025-02-08 14:10:21,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15145 conditions, 5057 events. 2161/5057 cut-off events. For 11707/11936 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 47636 event pairs, 1120 based on Foata normal form. 240/5106 useless extension candidates. Maximal degree in co-relation 15089. Up to 2284 conditions per place. [2025-02-08 14:10:21,320 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 101 selfloop transitions, 12 changer transitions 0/152 dead transitions. [2025-02-08 14:10:21,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 152 transitions, 1069 flow [2025-02-08 14:10:21,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:10:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:10:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 328 transitions. [2025-02-08 14:10:21,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6978723404255319 [2025-02-08 14:10:21,322 INFO L175 Difference]: Start difference. First operand has 139 places, 110 transitions, 610 flow. Second operand 5 states and 328 transitions. [2025-02-08 14:10:21,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 152 transitions, 1069 flow [2025-02-08 14:10:21,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 152 transitions, 1043 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:10:21,365 INFO L231 Difference]: Finished difference. Result has 139 places, 109 transitions, 610 flow [2025-02-08 14:10:21,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=610, PETRI_PLACES=139, PETRI_TRANSITIONS=109} [2025-02-08 14:10:21,365 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 51 predicate places. [2025-02-08 14:10:21,365 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 109 transitions, 610 flow [2025-02-08 14:10:21,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 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-02-08 14:10:21,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:21,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:21,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 14:10:21,366 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:21,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:21,366 INFO L85 PathProgramCache]: Analyzing trace with hash 668768942, now seen corresponding path program 1 times [2025-02-08 14:10:21,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:21,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010348623] [2025-02-08 14:10:21,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:21,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:21,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:10:21,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:10:21,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:21,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:21,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:21,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010348623] [2025-02-08 14:10:21,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010348623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:21,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:21,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:21,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684506018] [2025-02-08 14:10:21,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:21,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:21,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:21,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:21,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:21,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 94 [2025-02-08 14:10:21,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 109 transitions, 610 flow. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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-02-08 14:10:21,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:21,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 94 [2025-02-08 14:10:21,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:21,853 INFO L124 PetriNetUnfolderBase]: 2710/5582 cut-off events. [2025-02-08 14:10:21,854 INFO L125 PetriNetUnfolderBase]: For 13744/14305 co-relation queries the response was YES. [2025-02-08 14:10:21,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16626 conditions, 5582 events. 2710/5582 cut-off events. For 13744/14305 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 49352 event pairs, 1062 based on Foata normal form. 482/5893 useless extension candidates. Maximal degree in co-relation 16569. Up to 2100 conditions per place. [2025-02-08 14:10:21,878 INFO L140 encePairwiseOnDemand]: 85/94 looper letters, 114 selfloop transitions, 9 changer transitions 6/164 dead transitions. [2025-02-08 14:10:21,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 164 transitions, 1222 flow [2025-02-08 14:10:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 274 transitions. [2025-02-08 14:10:21,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7287234042553191 [2025-02-08 14:10:21,879 INFO L175 Difference]: Start difference. First operand has 139 places, 109 transitions, 610 flow. Second operand 4 states and 274 transitions. [2025-02-08 14:10:21,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 164 transitions, 1222 flow [2025-02-08 14:10:21,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 164 transitions, 1199 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:10:21,913 INFO L231 Difference]: Finished difference. Result has 140 places, 109 transitions, 628 flow [2025-02-08 14:10:21,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=628, PETRI_PLACES=140, PETRI_TRANSITIONS=109} [2025-02-08 14:10:21,913 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 52 predicate places. [2025-02-08 14:10:21,913 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 109 transitions, 628 flow [2025-02-08 14:10:21,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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-02-08 14:10:21,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:21,914 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:21,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 14:10:21,914 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:21,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1360449369, now seen corresponding path program 1 times [2025-02-08 14:10:21,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:21,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366017706] [2025-02-08 14:10:21,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:21,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:10:21,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:10:21,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:21,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:22,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:22,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366017706] [2025-02-08 14:10:22,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366017706] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:10:22,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111236102] [2025-02-08 14:10:22,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:22,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:10:22,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:10:22,084 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:10:22,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 14:10:22,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:10:22,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:10:22,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:22,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:22,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 14:10:22,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:10:22,169 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-02-08 14:10:22,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 14:10:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:22,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:10:22,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-08 14:10:22,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-02-08 14:10:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:22,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111236102] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:10:22,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:10:22,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 14:10:22,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913904592] [2025-02-08 14:10:22,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:10:22,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 14:10:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:22,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 14:10:22,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-08 14:10:22,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 94 [2025-02-08 14:10:22,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 109 transitions, 628 flow. Second operand has 11 states, 11 states have (on average 51.27272727272727) internal successors, (564), 11 states have internal predecessors, (564), 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-02-08 14:10:22,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:22,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 94 [2025-02-08 14:10:22,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:22,900 INFO L124 PetriNetUnfolderBase]: 1981/4380 cut-off events. [2025-02-08 14:10:22,900 INFO L125 PetriNetUnfolderBase]: For 11919/12395 co-relation queries the response was YES. [2025-02-08 14:10:22,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13601 conditions, 4380 events. 1981/4380 cut-off events. For 11919/12395 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 39105 event pairs, 672 based on Foata normal form. 391/4579 useless extension candidates. Maximal degree in co-relation 13544. Up to 1313 conditions per place. [2025-02-08 14:10:22,921 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 123 selfloop transitions, 12 changer transitions 2/178 dead transitions. [2025-02-08 14:10:22,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 178 transitions, 1299 flow [2025-02-08 14:10:22,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 14:10:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 14:10:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 537 transitions. [2025-02-08 14:10:22,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6347517730496454 [2025-02-08 14:10:22,923 INFO L175 Difference]: Start difference. First operand has 140 places, 109 transitions, 628 flow. Second operand 9 states and 537 transitions. [2025-02-08 14:10:22,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 178 transitions, 1299 flow [2025-02-08 14:10:22,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 178 transitions, 1279 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-08 14:10:22,961 INFO L231 Difference]: Finished difference. Result has 144 places, 109 transitions, 632 flow [2025-02-08 14:10:22,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=632, PETRI_PLACES=144, PETRI_TRANSITIONS=109} [2025-02-08 14:10:22,962 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 56 predicate places. [2025-02-08 14:10:22,962 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 109 transitions, 632 flow [2025-02-08 14:10:22,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 51.27272727272727) internal successors, (564), 11 states have internal predecessors, (564), 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-02-08 14:10:22,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:22,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:22,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 14:10:23,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 14:10:23,167 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:23,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1053313035, now seen corresponding path program 1 times [2025-02-08 14:10:23,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:23,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976291745] [2025-02-08 14:10:23,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:23,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:10:23,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:10:23,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:23,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:10:23,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:23,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976291745] [2025-02-08 14:10:23,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976291745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:23,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:23,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:10:23,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454443277] [2025-02-08 14:10:23,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:23,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:10:23,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:23,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:10:23,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:10:23,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 94 [2025-02-08 14:10:23,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 109 transitions, 632 flow. Second operand has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 6 states have internal predecessors, (268), 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-02-08 14:10:23,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:23,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 94 [2025-02-08 14:10:23,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:23,879 INFO L124 PetriNetUnfolderBase]: 2294/4869 cut-off events. [2025-02-08 14:10:23,880 INFO L125 PetriNetUnfolderBase]: For 12321/12588 co-relation queries the response was YES. [2025-02-08 14:10:23,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14870 conditions, 4869 events. 2294/4869 cut-off events. For 12321/12588 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 43228 event pairs, 995 based on Foata normal form. 277/4988 useless extension candidates. Maximal degree in co-relation 14812. Up to 1822 conditions per place. [2025-02-08 14:10:23,906 INFO L140 encePairwiseOnDemand]: 85/94 looper letters, 126 selfloop transitions, 14 changer transitions 6/185 dead transitions. [2025-02-08 14:10:23,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 185 transitions, 1377 flow [2025-02-08 14:10:23,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 14:10:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 14:10:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 402 transitions. [2025-02-08 14:10:23,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6109422492401215 [2025-02-08 14:10:23,907 INFO L175 Difference]: Start difference. First operand has 144 places, 109 transitions, 632 flow. Second operand 7 states and 402 transitions. [2025-02-08 14:10:23,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 185 transitions, 1377 flow [2025-02-08 14:10:23,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 185 transitions, 1337 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 14:10:23,948 INFO L231 Difference]: Finished difference. Result has 142 places, 107 transitions, 605 flow [2025-02-08 14:10:23,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=605, PETRI_PLACES=142, PETRI_TRANSITIONS=107} [2025-02-08 14:10:23,949 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 54 predicate places. [2025-02-08 14:10:23,949 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 107 transitions, 605 flow [2025-02-08 14:10:23,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 6 states have internal predecessors, (268), 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-02-08 14:10:23,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:23,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:23,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 14:10:23,950 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:23,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:23,950 INFO L85 PathProgramCache]: Analyzing trace with hash 775742495, now seen corresponding path program 1 times [2025-02-08 14:10:23,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:23,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131114369] [2025-02-08 14:10:23,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:23,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:23,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:10:23,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:10:23,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:23,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:10:24,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:24,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131114369] [2025-02-08 14:10:24,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131114369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:24,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:24,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:10:24,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307481374] [2025-02-08 14:10:24,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:24,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:10:24,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:24,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:10:24,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:10:24,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 94 [2025-02-08 14:10:24,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 107 transitions, 605 flow. Second operand has 5 states, 5 states have (on average 53.4) internal successors, (267), 5 states have internal predecessors, (267), 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-02-08 14:10:24,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:24,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 94 [2025-02-08 14:10:24,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:24,470 INFO L124 PetriNetUnfolderBase]: 2140/4791 cut-off events. [2025-02-08 14:10:24,470 INFO L125 PetriNetUnfolderBase]: For 11258/11606 co-relation queries the response was YES. [2025-02-08 14:10:24,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14518 conditions, 4791 events. 2140/4791 cut-off events. For 11258/11606 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 43985 event pairs, 1220 based on Foata normal form. 357/4911 useless extension candidates. Maximal degree in co-relation 14461. Up to 2290 conditions per place. [2025-02-08 14:10:24,493 INFO L140 encePairwiseOnDemand]: 85/94 looper letters, 107 selfloop transitions, 12 changer transitions 5/161 dead transitions. [2025-02-08 14:10:24,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 161 transitions, 1190 flow [2025-02-08 14:10:24,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:10:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:10:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 327 transitions. [2025-02-08 14:10:24,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6957446808510638 [2025-02-08 14:10:24,494 INFO L175 Difference]: Start difference. First operand has 142 places, 107 transitions, 605 flow. Second operand 5 states and 327 transitions. [2025-02-08 14:10:24,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 161 transitions, 1190 flow [2025-02-08 14:10:24,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 161 transitions, 1133 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:10:24,530 INFO L231 Difference]: Finished difference. Result has 139 places, 107 transitions, 608 flow [2025-02-08 14:10:24,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=608, PETRI_PLACES=139, PETRI_TRANSITIONS=107} [2025-02-08 14:10:24,531 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 51 predicate places. [2025-02-08 14:10:24,531 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 107 transitions, 608 flow [2025-02-08 14:10:24,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.4) internal successors, (267), 5 states have internal predecessors, (267), 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-02-08 14:10:24,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:24,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:24,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 14:10:24,531 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:24,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash 878755931, now seen corresponding path program 1 times [2025-02-08 14:10:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:24,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727485933] [2025-02-08 14:10:24,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:24,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:24,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:10:24,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:10:24,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:24,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:10:24,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:24,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727485933] [2025-02-08 14:10:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727485933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:24,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:24,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140503014] [2025-02-08 14:10:24,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:24,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:24,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:24,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:24,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:24,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 94 [2025-02-08 14:10:24,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 107 transitions, 608 flow. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 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-02-08 14:10:24,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:24,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 94 [2025-02-08 14:10:24,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:25,081 INFO L124 PetriNetUnfolderBase]: 2437/5015 cut-off events. [2025-02-08 14:10:25,081 INFO L125 PetriNetUnfolderBase]: For 11989/12466 co-relation queries the response was YES. [2025-02-08 14:10:25,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15174 conditions, 5015 events. 2437/5015 cut-off events. For 11989/12466 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 44144 event pairs, 1472 based on Foata normal form. 530/5327 useless extension candidates. Maximal degree in co-relation 15117. Up to 2739 conditions per place. [2025-02-08 14:10:25,098 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 83 selfloop transitions, 6 changer transitions 37/161 dead transitions. [2025-02-08 14:10:25,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 161 transitions, 1163 flow [2025-02-08 14:10:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2025-02-08 14:10:25,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7340425531914894 [2025-02-08 14:10:25,099 INFO L175 Difference]: Start difference. First operand has 139 places, 107 transitions, 608 flow. Second operand 4 states and 276 transitions. [2025-02-08 14:10:25,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 161 transitions, 1163 flow [2025-02-08 14:10:25,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 161 transitions, 1135 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:10:25,114 INFO L231 Difference]: Finished difference. Result has 140 places, 99 transitions, 535 flow [2025-02-08 14:10:25,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=535, PETRI_PLACES=140, PETRI_TRANSITIONS=99} [2025-02-08 14:10:25,114 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 52 predicate places. [2025-02-08 14:10:25,114 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 99 transitions, 535 flow [2025-02-08 14:10:25,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 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-02-08 14:10:25,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:25,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:25,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 14:10:25,115 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:25,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash 775743488, now seen corresponding path program 1 times [2025-02-08 14:10:25,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:25,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725774246] [2025-02-08 14:10:25,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:25,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:25,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:10:25,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:10:25,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:25,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:10:25,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:25,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725774246] [2025-02-08 14:10:25,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725774246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:25,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:25,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:10:25,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135324517] [2025-02-08 14:10:25,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:25,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:25,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:25,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:25,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 94 [2025-02-08 14:10:25,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 99 transitions, 535 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-02-08 14:10:25,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:25,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 94 [2025-02-08 14:10:25,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:25,504 INFO L124 PetriNetUnfolderBase]: 1785/3964 cut-off events. [2025-02-08 14:10:25,505 INFO L125 PetriNetUnfolderBase]: For 9103/9442 co-relation queries the response was YES. [2025-02-08 14:10:25,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12376 conditions, 3964 events. 1785/3964 cut-off events. For 9103/9442 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 35552 event pairs, 618 based on Foata normal form. 341/4268 useless extension candidates. Maximal degree in co-relation 12327. Up to 1242 conditions per place. [2025-02-08 14:10:25,523 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 100 selfloop transitions, 8 changer transitions 0/143 dead transitions. [2025-02-08 14:10:25,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 143 transitions, 992 flow [2025-02-08 14:10:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2025-02-08 14:10:25,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6941489361702128 [2025-02-08 14:10:25,525 INFO L175 Difference]: Start difference. First operand has 140 places, 99 transitions, 535 flow. Second operand 4 states and 261 transitions. [2025-02-08 14:10:25,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 143 transitions, 992 flow [2025-02-08 14:10:25,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 143 transitions, 925 flow, removed 4 selfloop flow, removed 15 redundant places. [2025-02-08 14:10:25,569 INFO L231 Difference]: Finished difference. Result has 124 places, 98 transitions, 499 flow [2025-02-08 14:10:25,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=499, PETRI_PLACES=124, PETRI_TRANSITIONS=98} [2025-02-08 14:10:25,570 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 36 predicate places. [2025-02-08 14:10:25,570 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 98 transitions, 499 flow [2025-02-08 14:10:25,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-02-08 14:10:25,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:25,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:25,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 14:10:25,571 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:25,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:25,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1669458598, now seen corresponding path program 1 times [2025-02-08 14:10:25,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:25,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40189398] [2025-02-08 14:10:25,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:25,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:25,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:10:25,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:10:25,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:25,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:10:25,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:25,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40189398] [2025-02-08 14:10:25,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40189398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:25,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:25,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:10:25,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782354745] [2025-02-08 14:10:25,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:25,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:10:25,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:25,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:10:25,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:10:25,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 94 [2025-02-08 14:10:25,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 98 transitions, 499 flow. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 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-02-08 14:10:25,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:25,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 94 [2025-02-08 14:10:25,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:26,200 INFO L124 PetriNetUnfolderBase]: 2115/4135 cut-off events. [2025-02-08 14:10:26,201 INFO L125 PetriNetUnfolderBase]: For 9661/10033 co-relation queries the response was YES. [2025-02-08 14:10:26,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13010 conditions, 4135 events. 2115/4135 cut-off events. For 9661/10033 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 33878 event pairs, 818 based on Foata normal form. 378/4433 useless extension candidates. Maximal degree in co-relation 12973. Up to 1613 conditions per place. [2025-02-08 14:10:26,219 INFO L140 encePairwiseOnDemand]: 81/94 looper letters, 74 selfloop transitions, 15 changer transitions 78/190 dead transitions. [2025-02-08 14:10:26,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 190 transitions, 1355 flow [2025-02-08 14:10:26,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:10:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:10:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 371 transitions. [2025-02-08 14:10:26,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6578014184397163 [2025-02-08 14:10:26,220 INFO L175 Difference]: Start difference. First operand has 124 places, 98 transitions, 499 flow. Second operand 6 states and 371 transitions. [2025-02-08 14:10:26,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 190 transitions, 1355 flow [2025-02-08 14:10:26,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 190 transitions, 1285 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 14:10:26,258 INFO L231 Difference]: Finished difference. Result has 126 places, 79 transitions, 404 flow [2025-02-08 14:10:26,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=126, PETRI_TRANSITIONS=79} [2025-02-08 14:10:26,259 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 38 predicate places. [2025-02-08 14:10:26,259 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 79 transitions, 404 flow [2025-02-08 14:10:26,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 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-02-08 14:10:26,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:26,261 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-02-08 14:10:26,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 14:10:26,261 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:26,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:26,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2114907897, now seen corresponding path program 2 times [2025-02-08 14:10:26,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:26,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960646589] [2025-02-08 14:10:26,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:10:26,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:26,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:10:26,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:10:26,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:10:26,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:10:26,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:26,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960646589] [2025-02-08 14:10:26,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960646589] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:10:26,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897758149] [2025-02-08 14:10:26,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:10:26,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:10:26,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:10:26,313 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:10:26,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 14:10:26,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:10:26,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:10:26,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 14:10:26,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:26,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:10:26,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:10:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:10:26,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:10:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:10:26,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897758149] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:10:26,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:10:26,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-02-08 14:10:26,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691086534] [2025-02-08 14:10:26,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:10:26,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:10:26,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:26,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:10:26,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:10:26,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 94 [2025-02-08 14:10:26,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 79 transitions, 404 flow. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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-02-08 14:10:26,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:26,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 94 [2025-02-08 14:10:26,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:26,552 INFO L124 PetriNetUnfolderBase]: 468/1255 cut-off events. [2025-02-08 14:10:26,552 INFO L125 PetriNetUnfolderBase]: For 2117/2192 co-relation queries the response was YES. [2025-02-08 14:10:26,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3652 conditions, 1255 events. 468/1255 cut-off events. For 2117/2192 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9986 event pairs, 432 based on Foata normal form. 74/1244 useless extension candidates. Maximal degree in co-relation 3619. Up to 812 conditions per place. [2025-02-08 14:10:26,559 INFO L140 encePairwiseOnDemand]: 89/94 looper letters, 31 selfloop transitions, 15 changer transitions 0/78 dead transitions. [2025-02-08 14:10:26,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 78 transitions, 486 flow [2025-02-08 14:10:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:10:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:10:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2025-02-08 14:10:26,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675531914893617 [2025-02-08 14:10:26,561 INFO L175 Difference]: Start difference. First operand has 126 places, 79 transitions, 404 flow. Second operand 4 states and 254 transitions. [2025-02-08 14:10:26,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 78 transitions, 486 flow [2025-02-08 14:10:26,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 78 transitions, 439 flow, removed 9 selfloop flow, removed 12 redundant places. [2025-02-08 14:10:26,571 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 377 flow [2025-02-08 14:10:26,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2025-02-08 14:10:26,572 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 10 predicate places. [2025-02-08 14:10:26,572 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 377 flow [2025-02-08 14:10:26,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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-02-08 14:10:26,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:26,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:26,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 14:10:26,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:10:26,773 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:26,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:26,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1721785460, now seen corresponding path program 1 times [2025-02-08 14:10:26,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:26,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371448153] [2025-02-08 14:10:26,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:26,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:26,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:10:26,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:10:26,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:26,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:10:26,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:26,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371448153] [2025-02-08 14:10:26,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371448153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:26,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:26,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:10:26,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269030379] [2025-02-08 14:10:26,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:26,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:10:26,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:26,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:10:26,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:10:26,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 94 [2025-02-08 14:10:26,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 377 flow. Second operand has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:10:26,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:26,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 94 [2025-02-08 14:10:26,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:27,090 INFO L124 PetriNetUnfolderBase]: 798/1725 cut-off events. [2025-02-08 14:10:27,090 INFO L125 PetriNetUnfolderBase]: For 2603/2721 co-relation queries the response was YES. [2025-02-08 14:10:27,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4731 conditions, 1725 events. 798/1725 cut-off events. For 2603/2721 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12825 event pairs, 60 based on Foata normal form. 182/1780 useless extension candidates. Maximal degree in co-relation 4649. Up to 545 conditions per place. [2025-02-08 14:10:27,095 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 108 selfloop transitions, 7 changer transitions 5/145 dead transitions. [2025-02-08 14:10:27,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 145 transitions, 944 flow [2025-02-08 14:10:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:10:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:10:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 329 transitions. [2025-02-08 14:10:27,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-08 14:10:27,096 INFO L175 Difference]: Start difference. First operand has 98 places, 78 transitions, 377 flow. Second operand 6 states and 329 transitions. [2025-02-08 14:10:27,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 145 transitions, 944 flow [2025-02-08 14:10:27,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 145 transitions, 902 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:10:27,100 INFO L231 Difference]: Finished difference. Result has 96 places, 71 transitions, 322 flow [2025-02-08 14:10:27,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=322, PETRI_PLACES=96, PETRI_TRANSITIONS=71} [2025-02-08 14:10:27,100 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 8 predicate places. [2025-02-08 14:10:27,100 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 71 transitions, 322 flow [2025-02-08 14:10:27,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.0) internal successors, (270), 6 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:10:27,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:10:27,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:27,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 14:10:27,101 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 49 more)] === [2025-02-08 14:10:27,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:10:27,101 INFO L85 PathProgramCache]: Analyzing trace with hash -917267254, now seen corresponding path program 1 times [2025-02-08 14:10:27,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:10:27,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869662946] [2025-02-08 14:10:27,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:10:27,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:10:27,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:10:27,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:10:27,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:10:27,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:10:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:10:27,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:10:27,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869662946] [2025-02-08 14:10:27,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869662946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:10:27,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:10:27,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:10:27,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384817318] [2025-02-08 14:10:27,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:10:27,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:10:27,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:10:27,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:10:27,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:10:27,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 94 [2025-02-08 14:10:27,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 71 transitions, 322 flow. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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-02-08 14:10:27,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:10:27,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 94 [2025-02-08 14:10:27,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:10:27,358 INFO L124 PetriNetUnfolderBase]: 402/813 cut-off events. [2025-02-08 14:10:27,358 INFO L125 PetriNetUnfolderBase]: For 1257/1315 co-relation queries the response was YES. [2025-02-08 14:10:27,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2476 conditions, 813 events. 402/813 cut-off events. For 1257/1315 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5016 event pairs, 60 based on Foata normal form. 91/875 useless extension candidates. Maximal degree in co-relation 2410. Up to 218 conditions per place. [2025-02-08 14:10:27,360 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 0 selfloop transitions, 0 changer transitions 137/137 dead transitions. [2025-02-08 14:10:27,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 137 transitions, 882 flow [2025-02-08 14:10:27,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:10:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:10:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 284 transitions. [2025-02-08 14:10:27,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6042553191489362 [2025-02-08 14:10:27,361 INFO L175 Difference]: Start difference. First operand has 96 places, 71 transitions, 322 flow. Second operand 5 states and 284 transitions. [2025-02-08 14:10:27,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 137 transitions, 882 flow [2025-02-08 14:10:27,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 137 transitions, 868 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:10:27,365 INFO L231 Difference]: Finished difference. Result has 86 places, 0 transitions, 0 flow [2025-02-08 14:10:27,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=86, PETRI_TRANSITIONS=0} [2025-02-08 14:10:27,366 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -2 predicate places. [2025-02-08 14:10:27,366 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 0 transitions, 0 flow [2025-02-08 14:10:27,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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-02-08 14:10:27,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 52 remaining) [2025-02-08 14:10:27,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 52 remaining) [2025-02-08 14:10:27,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 52 remaining) [2025-02-08 14:10:27,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 52 remaining) [2025-02-08 14:10:27,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 52 remaining) [2025-02-08 14:10:27,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 52 remaining) [2025-02-08 14:10:27,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 52 remaining) [2025-02-08 14:10:27,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 52 remaining) [2025-02-08 14:10:27,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 52 remaining) [2025-02-08 14:10:27,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 52 remaining) [2025-02-08 14:10:27,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 52 remaining) [2025-02-08 14:10:27,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 52 remaining) [2025-02-08 14:10:27,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 52 remaining) [2025-02-08 14:10:27,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 52 remaining) [2025-02-08 14:10:27,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 52 remaining) [2025-02-08 14:10:27,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 52 remaining) [2025-02-08 14:10:27,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 52 remaining) [2025-02-08 14:10:27,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 52 remaining) [2025-02-08 14:10:27,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 52 remaining) [2025-02-08 14:10:27,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 52 remaining) [2025-02-08 14:10:27,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 52 remaining) [2025-02-08 14:10:27,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 52 remaining) [2025-02-08 14:10:27,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 52 remaining) [2025-02-08 14:10:27,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 52 remaining) [2025-02-08 14:10:27,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 52 remaining) [2025-02-08 14:10:27,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 52 remaining) [2025-02-08 14:10:27,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 52 remaining) [2025-02-08 14:10:27,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 52 remaining) [2025-02-08 14:10:27,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 52 remaining) [2025-02-08 14:10:27,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 52 remaining) [2025-02-08 14:10:27,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 52 remaining) [2025-02-08 14:10:27,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 52 remaining) [2025-02-08 14:10:27,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 52 remaining) [2025-02-08 14:10:27,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 52 remaining) [2025-02-08 14:10:27,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 52 remaining) [2025-02-08 14:10:27,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 52 remaining) [2025-02-08 14:10:27,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 52 remaining) [2025-02-08 14:10:27,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 52 remaining) [2025-02-08 14:10:27,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 52 remaining) [2025-02-08 14:10:27,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 52 remaining) [2025-02-08 14:10:27,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 52 remaining) [2025-02-08 14:10:27,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 52 remaining) [2025-02-08 14:10:27,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 52 remaining) [2025-02-08 14:10:27,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 52 remaining) [2025-02-08 14:10:27,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 52 remaining) [2025-02-08 14:10:27,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 52 remaining) [2025-02-08 14:10:27,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 52 remaining) [2025-02-08 14:10:27,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 52 remaining) [2025-02-08 14:10:27,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 52 remaining) [2025-02-08 14:10:27,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 52 remaining) [2025-02-08 14:10:27,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 52 remaining) [2025-02-08 14:10:27,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 52 remaining) [2025-02-08 14:10:27,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 14:10:27,375 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:10:27,383 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 14:10:27,384 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 14:10:27,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 02:10:27 BasicIcfg [2025-02-08 14:10:27,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 14:10:27,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:10:27,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:10:27,391 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:10:27,392 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:10:04" (3/4) ... [2025-02-08 14:10:27,393 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 14:10:27,396 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 14:10:27,396 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 14:10:27,400 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 83 nodes and edges [2025-02-08 14:10:27,401 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2025-02-08 14:10:27,401 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-02-08 14:10:27,401 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 14:10:27,486 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:10:27,486 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 14:10:27,486 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:10:27,488 INFO L158 Benchmark]: Toolchain (without parser) took 24904.62ms. Allocated memory was 167.8MB in the beginning and 822.1MB in the end (delta: 654.3MB). Free memory was 123.0MB in the beginning and 417.4MB in the end (delta: -294.4MB). Peak memory consumption was 359.3MB. Max. memory is 16.1GB. [2025-02-08 14:10:27,488 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:10:27,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.02ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 110.3MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:10:27,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.38ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 107.9MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:10:27,489 INFO L158 Benchmark]: Boogie Preprocessor took 57.58ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 105.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:10:27,489 INFO L158 Benchmark]: IcfgBuilder took 1181.60ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 113.6MB in the end (delta: -8.6MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2025-02-08 14:10:27,489 INFO L158 Benchmark]: TraceAbstraction took 23297.41ms. Allocated memory was 167.8MB in the beginning and 822.1MB in the end (delta: 654.3MB). Free memory was 113.6MB in the beginning and 421.7MB in the end (delta: -308.1MB). Peak memory consumption was 344.6MB. Max. memory is 16.1GB. [2025-02-08 14:10:27,489 INFO L158 Benchmark]: Witness Printer took 95.53ms. Allocated memory is still 822.1MB. Free memory was 421.7MB in the beginning and 417.4MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:10:27,493 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.02ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 110.3MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.38ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 107.9MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.58ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 105.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1181.60ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 113.6MB in the end (delta: -8.6MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23297.41ms. Allocated memory was 167.8MB in the beginning and 822.1MB in the end (delta: 654.3MB). Free memory was 113.6MB in the beginning and 421.7MB in the end (delta: -308.1MB). Peak memory consumption was 344.6MB. Max. memory is 16.1GB. * Witness Printer took 95.53ms. Allocated memory is still 822.1MB. Free memory was 421.7MB in the beginning and 417.4MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 120]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 120]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 120]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 120]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 120]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 120]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 120]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 120]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 113]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 113]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 160 locations, 52 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.1s, OverallIterations: 32, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3706 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2978 mSDsluCounter, 1307 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1209 mSDsCounter, 307 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7944 IncrementalHoareTripleChecker+Invalid, 8251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 307 mSolverCounterUnsat, 98 mSDtfsCounter, 7944 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=632occurred in iteration=24, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 2367 SizeOfPredicates, 97 NumberOfNonLiveVariables, 783 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 45 InterpolantComputations, 26 PerfectInterpolantSequences, 95/142 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 54 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 14:10:27,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE