./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 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/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:11:14,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:11:14,567 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:11:14,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:11:14,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:11:14,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:11:14,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:11:14,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:11:14,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:11:14,584 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:11:14,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:11:14,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:11:14,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:11:14,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:11:14,585 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:11:14,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:11:14,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:11:14,585 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:11:14,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:11:14,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:11:14,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:11:14,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:11:14,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:11:14,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:11:14,585 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:11:14,586 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:11:14,586 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:11:14,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:11:14,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:11:14,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:11:14,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:11:14,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:11:14,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:11:14,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:11:14,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:11:14,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:11:14,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:11:14,587 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:11:14,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:11:14,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:11:14,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:11:14,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:11:14,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:11:14,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:11:14,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:11:14,587 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-02-08 14:11:14,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:11:14,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:11:14,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:11:14,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:11:14,812 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:11:14,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-02-08 14:11:15,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d4c2ae11/72119855906b4d3d82601146fd38935d/FLAGec947c81e [2025-02-08 14:11:16,137 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:11:16,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-02-08 14:11:16,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d4c2ae11/72119855906b4d3d82601146fd38935d/FLAGec947c81e [2025-02-08 14:11:16,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d4c2ae11/72119855906b4d3d82601146fd38935d [2025-02-08 14:11:16,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:11:16,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:11:16,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:11:16,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:11:16,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:11:16,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:11:16" (1/1) ... [2025-02-08 14:11:16,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443e3313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:16, skipping insertion in model container [2025-02-08 14:11:16,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:11:16" (1/1) ... [2025-02-08 14:11:16,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:11:16,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:11:16,382 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:11:16,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:11:16,412 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:11:16,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:16 WrapperNode [2025-02-08 14:11:16,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:11:16,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:11:16,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:11:16,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:11:16,418 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:11:16" (1/1) ... [2025-02-08 14:11:16,424 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:11:16" (1/1) ... [2025-02-08 14:11:16,450 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 331 [2025-02-08 14:11:16,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:11:16,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:11:16,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:11:16,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:11:16,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:16" (1/1) ... [2025-02-08 14:11:16,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:16" (1/1) ... [2025-02-08 14:11:16,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:16" (1/1) ... [2025-02-08 14:11:16,484 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-02-08 14:11:16,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:16" (1/1) ... [2025-02-08 14:11:16,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:16" (1/1) ... [2025-02-08 14:11:16,494 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:16" (1/1) ... [2025-02-08 14:11:16,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:16" (1/1) ... [2025-02-08 14:11:16,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:16" (1/1) ... [2025-02-08 14:11:16,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:16" (1/1) ... [2025-02-08 14:11:16,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:11:16,509 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:11:16,509 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:11:16,509 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:11:16,510 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:16" (1/1) ... [2025-02-08 14:11:16,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:11:16,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:16,536 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:11:16,538 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:11:16,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:11:16,554 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:11:16,555 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:11:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:11:16,555 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:11:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 14:11:16,555 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 14:11:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:11:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:11:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:11:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:11:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:11:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:11:16,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:11:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:11:16,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:11:16,557 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:11:16,652 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:11:16,653 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:11:16,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-1: havoc #t~post3#1; [2025-02-08 14:11:16,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-2: assume 1 + #t~post3#1 <= 2147483647; [2025-02-08 14:11:16,769 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-2: assume !(1 + #t~post3#1 <= 2147483647); [2025-02-08 14:11:16,770 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-3: ~i~0#1 := 1 + #t~post3#1; [2025-02-08 14:11:16,770 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-4: assume 1 + #t~post3#1 >= -2147483648; [2025-02-08 14:11:16,770 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-4: assume !(1 + #t~post3#1 >= -2147483648); [2025-02-08 14:11:16,770 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-5: #t~post3#1 := ~i~0#1; [2025-02-08 14:11:16,770 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51: havoc #t~ret2#1; [2025-02-08 14:11:16,770 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-1: havoc #t~mem1#1; [2025-02-08 14:11:16,770 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-2: ~asum~0 := #t~ret2#1; [2025-02-08 14:11:16,770 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 14:11:16,770 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:11:16,770 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-5: havoc plus_#t~short27#1, plus_#t~short28#1, plus_~a#1, plus_~b#1; [2025-02-08 14:11:16,771 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51-6: #t~ret2#1 := plus_#res#1; [2025-02-08 14:11:16,822 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-1: havoc #t~post6#1; [2025-02-08 14:11:16,822 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-2: assume 1 + #t~post6#1 <= 2147483647; [2025-02-08 14:11:16,822 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-2: assume !(1 + #t~post6#1 <= 2147483647); [2025-02-08 14:11:16,822 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-3: ~i~1#1 := 1 + #t~post6#1; [2025-02-08 14:11:16,822 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-4: assume 1 + #t~post6#1 >= -2147483648; [2025-02-08 14:11:16,822 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-4: assume !(1 + #t~post6#1 >= -2147483648); [2025-02-08 14:11:16,822 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-5: #t~post6#1 := ~i~1#1; [2025-02-08 14:11:16,822 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc #t~ret5#1; [2025-02-08 14:11:16,823 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-1: havoc #t~mem4#1; [2025-02-08 14:11:16,823 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-2: ~bsum~0 := #t~ret5#1; [2025-02-08 14:11:16,823 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 14:11:16,823 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:11:16,823 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-5: havoc plus_#t~short27#1, plus_#t~short28#1, plus_~a#1, plus_~b#1; [2025-02-08 14:11:16,823 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-6: #t~ret5#1 := plus_#res#1; [2025-02-08 14:11:16,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 14:11:16,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:11:16,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-5: havoc plus_#t~short27#1, plus_#t~short28#1, plus_~a#1, plus_~b#1; [2025-02-08 14:11:16,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-6: #t~ret11#1 := plus_#res#1; [2025-02-08 14:11:16,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-7: havoc plus_#t~short27#1, plus_#t~short28#1, plus_~a#1, plus_~b#1; [2025-02-08 14:11:16,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-8: havoc plus_#res#1; [2025-02-08 14:11:16,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-9: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~csum~0, #t~mem10#1; [2025-02-08 14:11:16,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-10: SUMMARY for call #t~mem10#1 := read~int#1(~C~0.base, ~C~0.offset + 4 * ~i~2#1, 4); srcloc: null [2025-02-08 14:11:16,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: assume plus_~a#1 + plus_~b#1 <= 2147483647; [2025-02-08 14:11:16,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: assume !(plus_~a#1 + plus_~b#1 <= 2147483647); [2025-02-08 14:11:16,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 14:11:16,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: assume plus_~a#1 + plus_~b#1 >= -2147483648; [2025-02-08 14:11:16,911 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: assume !(plus_~a#1 + plus_~b#1 >= -2147483648); [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38-1: assume false; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L38-3: assume false; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: plus_~b#1 := plus_#in~b#1; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: havoc #t~post12#1; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-2: assume 1 + #t~post12#1 <= 2147483647; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-2: assume !(1 + #t~post12#1 <= 2147483647); [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-3: ~i~2#1 := 1 + #t~post12#1; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-4: assume 1 + #t~post12#1 >= -2147483648; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-4: assume !(1 + #t~post12#1 >= -2147483648); [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-5: #t~post12#1 := ~i~2#1; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short27#1; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_#t~short27#1 then 1 else 0); [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-5: assume -2147483648 - plus_~b#1 <= 9223372036854775807; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-5: assume !(-2147483648 - plus_~b#1 <= 9223372036854775807); [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-6: plus_#t~short27#1 := plus_~a#1 >= -2147483648 - plus_~b#1; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-7: assume -2147483648 - plus_~b#1 >= -9223372036854775808; [2025-02-08 14:11:16,912 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-7: assume !(-2147483648 - plus_~b#1 >= -9223372036854775808); [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-8: assume plus_#t~short27#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-8: assume !plus_#t~short27#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-9: plus_#t~short27#1 := plus_~b#1 >= 0; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67: havoc #t~ret9#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-1: havoc #t~mem8#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-2: havoc #t~mem7#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-3: SUMMARY for call write~int#1(#t~ret9#1, ~C~0.base, ~C~0.offset + 4 * ~i~2#1, 4); srcloc: null [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-4: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-5: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-6: havoc plus_#t~short27#1, plus_#t~short28#1, plus_~a#1, plus_~b#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-7: #t~ret9#1 := plus_#res#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: assume { :end_inline_assume_abort_if_not } true;havoc plus_#t~short28#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_#t~short28#1 then 1 else 0); [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-5: assume 2147483647 - plus_~b#1 <= 2147483647; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-5: assume !(2147483647 - plus_~b#1 <= 2147483647); [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-6: plus_#t~short28#1 := plus_~a#1 <= 2147483647 - plus_~b#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-7: assume 2147483647 - plus_~b#1 >= -2147483648; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-7: assume !(2147483647 - plus_~b#1 >= -2147483648); [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-8: assume plus_#t~short28#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-8: assume !plus_#t~short28#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68: havoc #t~ret11#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-9: plus_#t~short28#1 := plus_~b#1 <= 0; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-1: havoc #t~mem10#1; [2025-02-08 14:11:16,913 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-2: ~csum~0 := #t~ret11#1; [2025-02-08 14:11:17,051 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:11:17,051 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:11:17,261 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:11:17,262 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:11:17,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:11:17 BoogieIcfgContainer [2025-02-08 14:11:17,263 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:11:17,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:11:17,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:11:17,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:11:17,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:11:16" (1/3) ... [2025-02-08 14:11:17,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c8c85e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:11:17, skipping insertion in model container [2025-02-08 14:11:17,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:11:16" (2/3) ... [2025-02-08 14:11:17,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c8c85e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:11:17, skipping insertion in model container [2025-02-08 14:11:17,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:11:17" (3/3) ... [2025-02-08 14:11:17,270 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-02-08 14:11:17,280 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:11:17,282 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 103 locations, 1 initial locations, 6 loop locations, and 42 error locations. [2025-02-08 14:11:17,283 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:11:17,343 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:11:17,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 113 transitions, 247 flow [2025-02-08 14:11:17,409 INFO L124 PetriNetUnfolderBase]: 11/110 cut-off events. [2025-02-08 14:11:17,411 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 14:11:17,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 11/110 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 376 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2025-02-08 14:11:17,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 113 transitions, 247 flow [2025-02-08 14:11:17,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 109 transitions, 236 flow [2025-02-08 14:11:17,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:11:17,433 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;@5070dfbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:11:17,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-02-08 14:11:17,441 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:11:17,441 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 14:11:17,441 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:11:17,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:17,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 14:11:17,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:17,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:17,447 INFO L85 PathProgramCache]: Analyzing trace with hash 900244, now seen corresponding path program 1 times [2025-02-08 14:11:17,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:17,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385210762] [2025-02-08 14:11:17,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:17,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:17,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:11:17,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:11:17,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:17,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:17,642 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:11:17,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:17,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385210762] [2025-02-08 14:11:17,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385210762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:17,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:17,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:11:17,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398913733] [2025-02-08 14:11:17,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:17,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:17,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:17,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:17,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:17,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 113 [2025-02-08 14:11:17,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 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:11:17,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:17,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 113 [2025-02-08 14:11:17,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:18,392 INFO L124 PetriNetUnfolderBase]: 3674/7545 cut-off events. [2025-02-08 14:11:18,392 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-02-08 14:11:18,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12808 conditions, 7545 events. 3674/7545 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 65230 event pairs, 2736 based on Foata normal form. 3/5922 useless extension candidates. Maximal degree in co-relation 12121. Up to 5036 conditions per place. [2025-02-08 14:11:18,434 INFO L140 encePairwiseOnDemand]: 97/113 looper letters, 53 selfloop transitions, 10 changer transitions 0/118 dead transitions. [2025-02-08 14:11:18,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 118 transitions, 380 flow [2025-02-08 14:11:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 301 transitions. [2025-02-08 14:11:18,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.665929203539823 [2025-02-08 14:11:18,444 INFO L175 Difference]: Start difference. First operand has 108 places, 109 transitions, 236 flow. Second operand 4 states and 301 transitions. [2025-02-08 14:11:18,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 118 transitions, 380 flow [2025-02-08 14:11:18,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 118 transitions, 368 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 14:11:18,454 INFO L231 Difference]: Finished difference. Result has 108 places, 118 transitions, 312 flow [2025-02-08 14:11:18,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=108, PETRI_TRANSITIONS=118} [2025-02-08 14:11:18,458 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 0 predicate places. [2025-02-08 14:11:18,458 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 118 transitions, 312 flow [2025-02-08 14:11:18,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 0 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:11:18,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:18,459 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 14:11:18,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:11:18,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:18,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:18,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1050119400, now seen corresponding path program 1 times [2025-02-08 14:11:18,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:18,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918382538] [2025-02-08 14:11:18,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:18,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:18,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:11:18,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:11:18,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:18,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:18,541 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:11:18,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:18,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918382538] [2025-02-08 14:11:18,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918382538] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:18,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423845412] [2025-02-08 14:11:18,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:18,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:18,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:18,544 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:11:18,545 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:11:18,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:11:18,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:11:18,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:18,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:18,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:11:18,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:18,636 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:11:18,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:11:18,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423845412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:18,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:11:18,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 14:11:18,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582475430] [2025-02-08 14:11:18,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:18,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:11:18,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:18,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:11:18,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:11:18,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 113 [2025-02-08 14:11:18,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 118 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 6 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:11:18,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:18,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 113 [2025-02-08 14:11:18,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:19,204 INFO L124 PetriNetUnfolderBase]: 3674/7542 cut-off events. [2025-02-08 14:11:19,205 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-02-08 14:11:19,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12690 conditions, 7542 events. 3674/7542 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 65186 event pairs, 2736 based on Foata normal form. 3/5924 useless extension candidates. Maximal degree in co-relation 12617. Up to 5021 conditions per place. [2025-02-08 14:11:19,244 INFO L140 encePairwiseOnDemand]: 100/113 looper letters, 43 selfloop transitions, 17 changer transitions 0/115 dead transitions. [2025-02-08 14:11:19,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 115 transitions, 420 flow [2025-02-08 14:11:19,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:11:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:11:19,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 411 transitions. [2025-02-08 14:11:19,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6061946902654868 [2025-02-08 14:11:19,249 INFO L175 Difference]: Start difference. First operand has 108 places, 118 transitions, 312 flow. Second operand 6 states and 411 transitions. [2025-02-08 14:11:19,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 115 transitions, 420 flow [2025-02-08 14:11:19,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:11:19,251 INFO L231 Difference]: Finished difference. Result has 110 places, 115 transitions, 334 flow [2025-02-08 14:11:19,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=334, PETRI_PLACES=110, PETRI_TRANSITIONS=115} [2025-02-08 14:11:19,253 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 2 predicate places. [2025-02-08 14:11:19,253 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 115 transitions, 334 flow [2025-02-08 14:11:19,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 6 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:11:19,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:19,254 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 14:11:19,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 14:11:19,457 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:11:19,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:19,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:19,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1806036212, now seen corresponding path program 1 times [2025-02-08 14:11:19,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:19,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394480235] [2025-02-08 14:11:19,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:19,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:19,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:11:19,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:11:19,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:19,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:19,615 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:11:19,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:19,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394480235] [2025-02-08 14:11:19,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394480235] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:19,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615888802] [2025-02-08 14:11:19,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:19,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:19,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:19,620 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:11:19,622 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:11:19,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:11:19,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:11:19,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:19,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:19,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:11:19,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:19,700 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:11:19,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:11:19,737 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:11:19,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615888802] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:11:19,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:11:19,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-08 14:11:19,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304714576] [2025-02-08 14:11:19,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:11:19,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:11:19,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:19,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:11:19,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:11:19,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 113 [2025-02-08 14:11:19,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 115 transitions, 334 flow. Second operand has 12 states, 12 states have (on average 59.083333333333336) internal successors, (709), 12 states have internal predecessors, (709), 0 states have call successors, (0), 0 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:11:19,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:19,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 113 [2025-02-08 14:11:19,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:20,330 INFO L124 PetriNetUnfolderBase]: 3683/7578 cut-off events. [2025-02-08 14:11:20,331 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-02-08 14:11:20,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12831 conditions, 7578 events. 3683/7578 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 65588 event pairs, 2736 based on Foata normal form. 9/5966 useless extension candidates. Maximal degree in co-relation 12619. Up to 5036 conditions per place. [2025-02-08 14:11:20,356 INFO L140 encePairwiseOnDemand]: 100/113 looper letters, 50 selfloop transitions, 37 changer transitions 0/142 dead transitions. [2025-02-08 14:11:20,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 142 transitions, 682 flow [2025-02-08 14:11:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:11:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:11:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 676 transitions. [2025-02-08 14:11:20,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5982300884955752 [2025-02-08 14:11:20,359 INFO L175 Difference]: Start difference. First operand has 110 places, 115 transitions, 334 flow. Second operand 10 states and 676 transitions. [2025-02-08 14:11:20,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 142 transitions, 682 flow [2025-02-08 14:11:20,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 142 transitions, 599 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-02-08 14:11:20,365 INFO L231 Difference]: Finished difference. Result has 117 places, 142 transitions, 549 flow [2025-02-08 14:11:20,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=549, PETRI_PLACES=117, PETRI_TRANSITIONS=142} [2025-02-08 14:11:20,365 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 9 predicate places. [2025-02-08 14:11:20,365 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 142 transitions, 549 flow [2025-02-08 14:11:20,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 59.083333333333336) internal successors, (709), 12 states have internal predecessors, (709), 0 states have call successors, (0), 0 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:11:20,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:20,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:20,373 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:11:20,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:20,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:20,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:20,567 INFO L85 PathProgramCache]: Analyzing trace with hash -774990125, now seen corresponding path program 1 times [2025-02-08 14:11:20,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:20,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066803079] [2025-02-08 14:11:20,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:20,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:20,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:11:20,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:11:20,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:20,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:20,640 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:11:20,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:20,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066803079] [2025-02-08 14:11:20,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066803079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:20,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:20,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:20,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114793659] [2025-02-08 14:11:20,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:20,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:20,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:20,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:20,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:20,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 113 [2025-02-08 14:11:20,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 142 transitions, 549 flow. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:20,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:20,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 113 [2025-02-08 14:11:20,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:21,592 INFO L124 PetriNetUnfolderBase]: 7641/13729 cut-off events. [2025-02-08 14:11:21,592 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2025-02-08 14:11:21,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24542 conditions, 13729 events. 7641/13729 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 115366 event pairs, 2685 based on Foata normal form. 364/11465 useless extension candidates. Maximal degree in co-relation 24444. Up to 4781 conditions per place. [2025-02-08 14:11:21,628 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 131 selfloop transitions, 4 changer transitions 0/187 dead transitions. [2025-02-08 14:11:21,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 187 transitions, 913 flow [2025-02-08 14:11:21,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2025-02-08 14:11:21,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7389380530973452 [2025-02-08 14:11:21,630 INFO L175 Difference]: Start difference. First operand has 117 places, 142 transitions, 549 flow. Second operand 4 states and 334 transitions. [2025-02-08 14:11:21,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 187 transitions, 913 flow [2025-02-08 14:11:21,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 187 transitions, 876 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-02-08 14:11:21,633 INFO L231 Difference]: Finished difference. Result has 120 places, 143 transitions, 538 flow [2025-02-08 14:11:21,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=538, PETRI_PLACES=120, PETRI_TRANSITIONS=143} [2025-02-08 14:11:21,633 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 12 predicate places. [2025-02-08 14:11:21,634 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 143 transitions, 538 flow [2025-02-08 14:11:21,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:21,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:21,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:21,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:11:21,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:21,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:21,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1745110773, now seen corresponding path program 1 times [2025-02-08 14:11:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:21,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274187543] [2025-02-08 14:11:21,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:21,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:11:21,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:11:21,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:21,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:21,698 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:11:21,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:21,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274187543] [2025-02-08 14:11:21,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274187543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:21,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:21,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:11:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984349061] [2025-02-08 14:11:21,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:21,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:11:21,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:21,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:11:21,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:11:21,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 113 [2025-02-08 14:11:21,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 143 transitions, 538 flow. Second operand has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:21,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:21,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 113 [2025-02-08 14:11:21,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:22,353 INFO L124 PetriNetUnfolderBase]: 5973/12504 cut-off events. [2025-02-08 14:11:22,353 INFO L125 PetriNetUnfolderBase]: For 1604/1876 co-relation queries the response was YES. [2025-02-08 14:11:22,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22091 conditions, 12504 events. 5973/12504 cut-off events. For 1604/1876 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 113307 event pairs, 4294 based on Foata normal form. 319/10547 useless extension candidates. Maximal degree in co-relation 21938. Up to 6507 conditions per place. [2025-02-08 14:11:22,400 INFO L140 encePairwiseOnDemand]: 103/113 looper letters, 144 selfloop transitions, 24 changer transitions 0/226 dead transitions. [2025-02-08 14:11:22,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 226 transitions, 1177 flow [2025-02-08 14:11:22,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:11:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:11:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2025-02-08 14:11:22,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7477876106194691 [2025-02-08 14:11:22,404 INFO L175 Difference]: Start difference. First operand has 120 places, 143 transitions, 538 flow. Second operand 6 states and 507 transitions. [2025-02-08 14:11:22,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 226 transitions, 1177 flow [2025-02-08 14:11:22,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 226 transitions, 1177 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:11:22,418 INFO L231 Difference]: Finished difference. Result has 128 places, 153 transitions, 672 flow [2025-02-08 14:11:22,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=672, PETRI_PLACES=128, PETRI_TRANSITIONS=153} [2025-02-08 14:11:22,420 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 20 predicate places. [2025-02-08 14:11:22,420 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 153 transitions, 672 flow [2025-02-08 14:11:22,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:22,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:22,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:22,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:11:22,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:22,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:22,422 INFO L85 PathProgramCache]: Analyzing trace with hash 816665493, now seen corresponding path program 1 times [2025-02-08 14:11:22,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:22,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712190957] [2025-02-08 14:11:22,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:22,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:22,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:11:22,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:11:22,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:22,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:22,503 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:11:22,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:22,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712190957] [2025-02-08 14:11:22,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712190957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:22,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:22,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:22,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720983137] [2025-02-08 14:11:22,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:22,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:22,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:22,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:22,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:22,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 113 [2025-02-08 14:11:22,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 153 transitions, 672 flow. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:11:22,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:22,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 113 [2025-02-08 14:11:22,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:23,800 INFO L124 PetriNetUnfolderBase]: 13094/24408 cut-off events. [2025-02-08 14:11:23,800 INFO L125 PetriNetUnfolderBase]: For 6098/6378 co-relation queries the response was YES. [2025-02-08 14:11:23,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48280 conditions, 24408 events. 13094/24408 cut-off events. For 6098/6378 co-relation queries the response was YES. Maximal size of possible extension queue 1146. Compared 222045 event pairs, 4683 based on Foata normal form. 796/21641 useless extension candidates. Maximal degree in co-relation 48119. Up to 7990 conditions per place. [2025-02-08 14:11:23,919 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 146 selfloop transitions, 4 changer transitions 0/202 dead transitions. [2025-02-08 14:11:23,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 202 transitions, 1126 flow [2025-02-08 14:11:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2025-02-08 14:11:23,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7345132743362832 [2025-02-08 14:11:23,921 INFO L175 Difference]: Start difference. First operand has 128 places, 153 transitions, 672 flow. Second operand 4 states and 332 transitions. [2025-02-08 14:11:23,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 202 transitions, 1126 flow [2025-02-08 14:11:23,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 202 transitions, 1122 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-02-08 14:11:23,969 INFO L231 Difference]: Finished difference. Result has 133 places, 154 transitions, 694 flow [2025-02-08 14:11:23,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=694, PETRI_PLACES=133, PETRI_TRANSITIONS=154} [2025-02-08 14:11:23,969 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 25 predicate places. [2025-02-08 14:11:23,969 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 154 transitions, 694 flow [2025-02-08 14:11:23,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:11:23,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:23,970 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:23,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:11:23,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:23,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:23,970 INFO L85 PathProgramCache]: Analyzing trace with hash -453172600, now seen corresponding path program 1 times [2025-02-08 14:11:23,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:23,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146392239] [2025-02-08 14:11:23,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:23,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:23,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 14:11:23,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 14:11:23,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:23,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:24,044 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:11:24,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:24,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146392239] [2025-02-08 14:11:24,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146392239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:24,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:24,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:11:24,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392635046] [2025-02-08 14:11:24,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:24,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:11:24,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:24,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:11:24,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:11:24,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 113 [2025-02-08 14:11:24,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 154 transitions, 694 flow. Second operand has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:24,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:24,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 113 [2025-02-08 14:11:24,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:25,169 INFO L124 PetriNetUnfolderBase]: 6801/14764 cut-off events. [2025-02-08 14:11:25,170 INFO L125 PetriNetUnfolderBase]: For 4893/5570 co-relation queries the response was YES. [2025-02-08 14:11:25,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28388 conditions, 14764 events. 6801/14764 cut-off events. For 4893/5570 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 144149 event pairs, 5546 based on Foata normal form. 418/12850 useless extension candidates. Maximal degree in co-relation 28224. Up to 8991 conditions per place. [2025-02-08 14:11:25,220 INFO L140 encePairwiseOnDemand]: 103/113 looper letters, 130 selfloop transitions, 24 changer transitions 2/214 dead transitions. [2025-02-08 14:11:25,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 214 transitions, 1240 flow [2025-02-08 14:11:25,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:11:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:11:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2025-02-08 14:11:25,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7286135693215339 [2025-02-08 14:11:25,226 INFO L175 Difference]: Start difference. First operand has 133 places, 154 transitions, 694 flow. Second operand 6 states and 494 transitions. [2025-02-08 14:11:25,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 214 transitions, 1240 flow [2025-02-08 14:11:25,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 214 transitions, 1240 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:11:25,236 INFO L231 Difference]: Finished difference. Result has 140 places, 156 transitions, 764 flow [2025-02-08 14:11:25,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=764, PETRI_PLACES=140, PETRI_TRANSITIONS=156} [2025-02-08 14:11:25,236 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 32 predicate places. [2025-02-08 14:11:25,236 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 156 transitions, 764 flow [2025-02-08 14:11:25,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:25,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:25,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:25,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:11:25,237 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:25,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:25,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1952534976, now seen corresponding path program 1 times [2025-02-08 14:11:25,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:25,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757928794] [2025-02-08 14:11:25,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:25,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:25,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:11:25,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:11:25,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:25,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:25,278 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:11:25,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:25,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757928794] [2025-02-08 14:11:25,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757928794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:25,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:25,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:25,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305767534] [2025-02-08 14:11:25,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:25,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:25,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:25,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:25,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:25,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 113 [2025-02-08 14:11:25,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 156 transitions, 764 flow. Second operand has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:11:25,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:25,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 113 [2025-02-08 14:11:25,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:26,772 INFO L124 PetriNetUnfolderBase]: 13961/26755 cut-off events. [2025-02-08 14:11:26,773 INFO L125 PetriNetUnfolderBase]: For 12318/13490 co-relation queries the response was YES. [2025-02-08 14:11:26,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56593 conditions, 26755 events. 13961/26755 cut-off events. For 12318/13490 co-relation queries the response was YES. Maximal size of possible extension queue 1460. Compared 257198 event pairs, 5680 based on Foata normal form. 1282/24666 useless extension candidates. Maximal degree in co-relation 56422. Up to 9205 conditions per place. [2025-02-08 14:11:26,942 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 153 selfloop transitions, 4 changer transitions 0/209 dead transitions. [2025-02-08 14:11:26,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 209 transitions, 1292 flow [2025-02-08 14:11:26,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 330 transitions. [2025-02-08 14:11:26,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7300884955752213 [2025-02-08 14:11:26,944 INFO L175 Difference]: Start difference. First operand has 140 places, 156 transitions, 764 flow. Second operand 4 states and 330 transitions. [2025-02-08 14:11:26,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 209 transitions, 1292 flow [2025-02-08 14:11:27,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 209 transitions, 1256 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:11:27,017 INFO L231 Difference]: Finished difference. Result has 142 places, 157 transitions, 754 flow [2025-02-08 14:11:27,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=754, PETRI_PLACES=142, PETRI_TRANSITIONS=157} [2025-02-08 14:11:27,018 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 34 predicate places. [2025-02-08 14:11:27,018 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 157 transitions, 754 flow [2025-02-08 14:11:27,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.25) internal successors, (245), 4 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:11:27,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:27,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:27,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:11:27,019 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:27,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:27,019 INFO L85 PathProgramCache]: Analyzing trace with hash -399041198, now seen corresponding path program 1 times [2025-02-08 14:11:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:27,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003071828] [2025-02-08 14:11:27,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:27,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:11:27,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:11:27,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:27,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:27,084 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:11:27,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:27,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003071828] [2025-02-08 14:11:27,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003071828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:27,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:27,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:11:27,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439335861] [2025-02-08 14:11:27,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:27,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:11:27,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:27,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:11:27,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:11:27,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 113 [2025-02-08 14:11:27,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 157 transitions, 754 flow. Second operand has 5 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:27,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:27,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 113 [2025-02-08 14:11:27,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:28,395 INFO L124 PetriNetUnfolderBase]: 9297/19923 cut-off events. [2025-02-08 14:11:28,395 INFO L125 PetriNetUnfolderBase]: For 10496/11686 co-relation queries the response was YES. [2025-02-08 14:11:28,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42362 conditions, 19923 events. 9297/19923 cut-off events. For 10496/11686 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 203980 event pairs, 8091 based on Foata normal form. 652/18575 useless extension candidates. Maximal degree in co-relation 42192. Up to 12617 conditions per place. [2025-02-08 14:11:28,505 INFO L140 encePairwiseOnDemand]: 103/113 looper letters, 120 selfloop transitions, 24 changer transitions 0/202 dead transitions. [2025-02-08 14:11:28,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 202 transitions, 1254 flow [2025-02-08 14:11:28,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:11:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:11:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 481 transitions. [2025-02-08 14:11:28,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7094395280235988 [2025-02-08 14:11:28,507 INFO L175 Difference]: Start difference. First operand has 142 places, 157 transitions, 754 flow. Second operand 6 states and 481 transitions. [2025-02-08 14:11:28,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 202 transitions, 1254 flow [2025-02-08 14:11:28,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 202 transitions, 1254 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:11:28,578 INFO L231 Difference]: Finished difference. Result has 149 places, 159 transitions, 824 flow [2025-02-08 14:11:28,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=824, PETRI_PLACES=149, PETRI_TRANSITIONS=159} [2025-02-08 14:11:28,579 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 41 predicate places. [2025-02-08 14:11:28,579 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 159 transitions, 824 flow [2025-02-08 14:11:28,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:11:28,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:28,579 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-02-08 14:11:28,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:11:28,579 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:28,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:28,580 INFO L85 PathProgramCache]: Analyzing trace with hash 22739424, now seen corresponding path program 2 times [2025-02-08 14:11:28,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:28,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370563234] [2025-02-08 14:11:28,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:11:28,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:28,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:11:28,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-08 14:11:28,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:11:28,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:11:28,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:28,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370563234] [2025-02-08 14:11:28,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370563234] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:28,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070743335] [2025-02-08 14:11:28,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:11:28,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:28,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:28,614 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:11:28,616 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:11:28,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:11:28,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-08 14:11:28,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:11:28,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:28,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:11:28,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:11:28,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:11:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:11:28,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070743335] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:11:28,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:11:28,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-02-08 14:11:28,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11803751] [2025-02-08 14:11:28,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:11:28,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:28,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:28,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:28,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:28,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 113 [2025-02-08 14:11:28,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 159 transitions, 824 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 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:11:28,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:28,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 113 [2025-02-08 14:11:28,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:30,034 INFO L124 PetriNetUnfolderBase]: 9349/20437 cut-off events. [2025-02-08 14:11:30,034 INFO L125 PetriNetUnfolderBase]: For 11672/12875 co-relation queries the response was YES. [2025-02-08 14:11:30,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43977 conditions, 20437 events. 9349/20437 cut-off events. For 11672/12875 co-relation queries the response was YES. Maximal size of possible extension queue 1208. Compared 213331 event pairs, 8208 based on Foata normal form. 643/18851 useless extension candidates. Maximal degree in co-relation 43801. Up to 12987 conditions per place. [2025-02-08 14:11:30,122 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 87 selfloop transitions, 16 changer transitions 0/158 dead transitions. [2025-02-08 14:11:30,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 158 transitions, 1020 flow [2025-02-08 14:11:30,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:30,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2025-02-08 14:11:30,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6261061946902655 [2025-02-08 14:11:30,124 INFO L175 Difference]: Start difference. First operand has 149 places, 159 transitions, 824 flow. Second operand 4 states and 283 transitions. [2025-02-08 14:11:30,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 158 transitions, 1020 flow [2025-02-08 14:11:30,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 158 transitions, 984 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:11:30,176 INFO L231 Difference]: Finished difference. Result has 148 places, 158 transitions, 810 flow [2025-02-08 14:11:30,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=810, PETRI_PLACES=148, PETRI_TRANSITIONS=158} [2025-02-08 14:11:30,177 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 40 predicate places. [2025-02-08 14:11:30,177 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 158 transitions, 810 flow [2025-02-08 14:11:30,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 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:11:30,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:30,177 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-02-08 14:11:30,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:11:30,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:30,378 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:30,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1440934739, now seen corresponding path program 1 times [2025-02-08 14:11:30,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:30,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246281438] [2025-02-08 14:11:30,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:30,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:30,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:11:30,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:11:30,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:30,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 14:11:30,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:30,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246281438] [2025-02-08 14:11:30,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246281438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:30,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:30,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:30,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545306341] [2025-02-08 14:11:30,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:30,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:11:30,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:30,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:11:30,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:11:30,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 113 [2025-02-08 14:11:30,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 158 transitions, 810 flow. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 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:11:30,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:30,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 113 [2025-02-08 14:11:30,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:31,865 INFO L124 PetriNetUnfolderBase]: 9339/20397 cut-off events. [2025-02-08 14:11:31,866 INFO L125 PetriNetUnfolderBase]: For 11527/12730 co-relation queries the response was YES. [2025-02-08 14:11:31,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43813 conditions, 20397 events. 9339/20397 cut-off events. For 11527/12730 co-relation queries the response was YES. Maximal size of possible extension queue 1208. Compared 212983 event pairs, 8208 based on Foata normal form. 644/18813 useless extension candidates. Maximal degree in co-relation 43700. Up to 12951 conditions per place. [2025-02-08 14:11:31,990 INFO L140 encePairwiseOnDemand]: 104/113 looper letters, 79 selfloop transitions, 16 changer transitions 0/152 dead transitions. [2025-02-08 14:11:31,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 152 transitions, 920 flow [2025-02-08 14:11:31,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:11:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:11:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-02-08 14:11:31,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7013274336283186 [2025-02-08 14:11:31,992 INFO L175 Difference]: Start difference. First operand has 148 places, 158 transitions, 810 flow. Second operand 4 states and 317 transitions. [2025-02-08 14:11:31,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 152 transitions, 920 flow [2025-02-08 14:11:32,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 152 transitions, 876 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:11:32,055 INFO L231 Difference]: Finished difference. Result has 148 places, 152 transitions, 725 flow [2025-02-08 14:11:32,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=725, PETRI_PLACES=148, PETRI_TRANSITIONS=152} [2025-02-08 14:11:32,056 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 40 predicate places. [2025-02-08 14:11:32,056 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 152 transitions, 725 flow [2025-02-08 14:11:32,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 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:11:32,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:32,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:32,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:11:32,057 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:32,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash -4040876, now seen corresponding path program 1 times [2025-02-08 14:11:32,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:32,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375627480] [2025-02-08 14:11:32,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:32,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:32,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:11:32,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:11:32,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:32,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:32,608 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:11:32,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375627480] [2025-02-08 14:11:32,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375627480] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590807479] [2025-02-08 14:11:32,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:32,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:32,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:32,612 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:11:32,616 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:11:32,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:11:32,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:11:32,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:32,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:32,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 14:11:32,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:32,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:11:32,715 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:11:32,755 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 14:11:32,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 14:11:32,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:11:32,849 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-08 14:11:32,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-08 14:11:32,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:11:32,924 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:11:32,940 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:11:32,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:11:33,004 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_132 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_132) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2025-02-08 14:11:33,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:11:33,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-02-08 14:11:33,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:11:33,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 135 [2025-02-08 14:11:33,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-02-08 14:11:33,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-02-08 14:11:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-08 14:11:33,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590807479] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:11:33,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:11:33,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2025-02-08 14:11:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049640327] [2025-02-08 14:11:33,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:11:33,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 14:11:33,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:33,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 14:11:33,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=462, Unknown=2, NotChecked=44, Total=600 [2025-02-08 14:11:33,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 113 [2025-02-08 14:11:33,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 152 transitions, 725 flow. Second operand has 25 states, 25 states have (on average 56.72) internal successors, (1418), 25 states have internal predecessors, (1418), 0 states have call successors, (0), 0 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:11:33,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:33,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 113 [2025-02-08 14:11:33,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:35,610 INFO L124 PetriNetUnfolderBase]: 17765/28282 cut-off events. [2025-02-08 14:11:35,610 INFO L125 PetriNetUnfolderBase]: For 18230/20265 co-relation queries the response was YES. [2025-02-08 14:11:35,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69462 conditions, 28282 events. 17765/28282 cut-off events. For 18230/20265 co-relation queries the response was YES. Maximal size of possible extension queue 1452. Compared 227176 event pairs, 1498 based on Foata normal form. 1038/27027 useless extension candidates. Maximal degree in co-relation 69352. Up to 21224 conditions per place. [2025-02-08 14:11:35,859 INFO L140 encePairwiseOnDemand]: 99/113 looper letters, 147 selfloop transitions, 27 changer transitions 0/222 dead transitions. [2025-02-08 14:11:35,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 222 transitions, 1348 flow [2025-02-08 14:11:35,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 14:11:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 14:11:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 734 transitions. [2025-02-08 14:11:35,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5905068382944489 [2025-02-08 14:11:35,861 INFO L175 Difference]: Start difference. First operand has 148 places, 152 transitions, 725 flow. Second operand 11 states and 734 transitions. [2025-02-08 14:11:35,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 222 transitions, 1348 flow [2025-02-08 14:11:35,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 222 transitions, 1314 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:11:35,997 INFO L231 Difference]: Finished difference. Result has 156 places, 154 transitions, 789 flow [2025-02-08 14:11:35,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=789, PETRI_PLACES=156, PETRI_TRANSITIONS=154} [2025-02-08 14:11:35,998 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 48 predicate places. [2025-02-08 14:11:35,998 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 154 transitions, 789 flow [2025-02-08 14:11:35,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 56.72) internal successors, (1418), 25 states have internal predecessors, (1418), 0 states have call successors, (0), 0 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:11:35,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:35,999 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:36,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 14:11:36,203 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,SelfDestructingSolverStorable11 [2025-02-08 14:11:36,203 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:36,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:36,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1291872089, now seen corresponding path program 1 times [2025-02-08 14:11:36,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:36,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908948257] [2025-02-08 14:11:36,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:36,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:36,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:11:36,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:11:36,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:36,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 14:11:36,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:36,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908948257] [2025-02-08 14:11:36,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908948257] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:36,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316123910] [2025-02-08 14:11:36,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:36,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:36,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:36,328 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:11:36,330 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:11:36,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:11:36,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:11:36,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:36,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:36,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 14:11:36,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:36,468 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 14:11:36,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:11:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 14:11:36,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316123910] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:11:36,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:11:36,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-02-08 14:11:36,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842367474] [2025-02-08 14:11:36,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:11:36,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:11:36,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:36,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:11:36,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-02-08 14:11:36,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 113 [2025-02-08 14:11:36,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 154 transitions, 789 flow. Second operand has 19 states, 19 states have (on average 59.21052631578947) internal successors, (1125), 19 states have internal predecessors, (1125), 0 states have call successors, (0), 0 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:11:36,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:36,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 113 [2025-02-08 14:11:36,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:40,051 INFO L124 PetriNetUnfolderBase]: 18611/40162 cut-off events. [2025-02-08 14:11:40,051 INFO L125 PetriNetUnfolderBase]: For 31878/34321 co-relation queries the response was YES. [2025-02-08 14:11:40,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90395 conditions, 40162 events. 18611/40162 cut-off events. For 31878/34321 co-relation queries the response was YES. Maximal size of possible extension queue 1704. Compared 443917 event pairs, 16336 based on Foata normal form. 1292/37475 useless extension candidates. Maximal degree in co-relation 90280. Up to 13143 conditions per place. [2025-02-08 14:11:40,472 INFO L140 encePairwiseOnDemand]: 103/113 looper letters, 99 selfloop transitions, 50 changer transitions 0/203 dead transitions. [2025-02-08 14:11:40,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 203 transitions, 1320 flow [2025-02-08 14:11:40,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 14:11:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 14:11:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 756 transitions. [2025-02-08 14:11:40,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6082059533386966 [2025-02-08 14:11:40,479 INFO L175 Difference]: Start difference. First operand has 156 places, 154 transitions, 789 flow. Second operand 11 states and 756 transitions. [2025-02-08 14:11:40,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 203 transitions, 1320 flow [2025-02-08 14:11:40,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 203 transitions, 1279 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:11:40,767 INFO L231 Difference]: Finished difference. Result has 163 places, 162 transitions, 939 flow [2025-02-08 14:11:40,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=939, PETRI_PLACES=163, PETRI_TRANSITIONS=162} [2025-02-08 14:11:40,768 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 55 predicate places. [2025-02-08 14:11:40,768 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 162 transitions, 939 flow [2025-02-08 14:11:40,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 59.21052631578947) internal successors, (1125), 19 states have internal predecessors, (1125), 0 states have call successors, (0), 0 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:11:40,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:40,768 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:40,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:11:40,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 14:11:40,969 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:40,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash -125297032, now seen corresponding path program 1 times [2025-02-08 14:11:40,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:40,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051428324] [2025-02-08 14:11:40,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:40,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:40,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:11:41,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:11:41,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:41,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:41,324 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:11:41,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:41,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051428324] [2025-02-08 14:11:41,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051428324] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:41,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834900567] [2025-02-08 14:11:41,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:41,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:41,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:41,327 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:11:41,328 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:11:41,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 14:11:41,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 14:11:41,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:41,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:41,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 14:11:41,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:41,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:11:41,415 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:11:41,446 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 14:11:41,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 14:11:41,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 14:11:41,517 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-08 14:11:41,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-08 14:11:41,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 14:11:41,569 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:11:41,582 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:11:41,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:11:41,623 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_194 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_194) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2025-02-08 14:11:41,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:11:41,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-08 14:11:41,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:11:41,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 59 [2025-02-08 14:11:41,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-02-08 14:11:41,766 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 46 treesize of output 42 [2025-02-08 14:11:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-08 14:11:41,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834900567] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:11:41,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:11:41,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2025-02-08 14:11:41,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357356915] [2025-02-08 14:11:41,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:11:41,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 14:11:41,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:41,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 14:11:41,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=462, Unknown=2, NotChecked=44, Total=600 [2025-02-08 14:11:41,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 113 [2025-02-08 14:11:41,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 162 transitions, 939 flow. Second operand has 25 states, 25 states have (on average 56.72) internal successors, (1418), 25 states have internal predecessors, (1418), 0 states have call successors, (0), 0 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:11:41,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:41,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 113 [2025-02-08 14:11:41,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:45,891 INFO L124 PetriNetUnfolderBase]: 34784/67554 cut-off events. [2025-02-08 14:11:45,892 INFO L125 PetriNetUnfolderBase]: For 42804/47336 co-relation queries the response was YES. [2025-02-08 14:11:46,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150330 conditions, 67554 events. 34784/67554 cut-off events. For 42804/47336 co-relation queries the response was YES. Maximal size of possible extension queue 2627. Compared 716732 event pairs, 15071 based on Foata normal form. 3194/62598 useless extension candidates. Maximal degree in co-relation 150204. Up to 41886 conditions per place. [2025-02-08 14:11:46,578 INFO L140 encePairwiseOnDemand]: 99/113 looper letters, 147 selfloop transitions, 34 changer transitions 0/229 dead transitions. [2025-02-08 14:11:46,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 229 transitions, 1547 flow [2025-02-08 14:11:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 14:11:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 14:11:46,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 733 transitions. [2025-02-08 14:11:46,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.589702333065165 [2025-02-08 14:11:46,580 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 939 flow. Second operand 11 states and 733 transitions. [2025-02-08 14:11:46,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 229 transitions, 1547 flow [2025-02-08 14:11:46,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 229 transitions, 1485 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 14:11:46,763 INFO L231 Difference]: Finished difference. Result has 168 places, 161 transitions, 941 flow [2025-02-08 14:11:46,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=941, PETRI_PLACES=168, PETRI_TRANSITIONS=161} [2025-02-08 14:11:46,763 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 60 predicate places. [2025-02-08 14:11:46,763 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 161 transitions, 941 flow [2025-02-08 14:11:46,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 56.72) internal successors, (1418), 25 states have internal predecessors, (1418), 0 states have call successors, (0), 0 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:11:46,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:46,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:46,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 14:11:46,964 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,SelfDestructingSolverStorable13 [2025-02-08 14:11:46,965 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:46,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:46,966 INFO L85 PathProgramCache]: Analyzing trace with hash -2055694553, now seen corresponding path program 1 times [2025-02-08 14:11:46,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:46,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172251161] [2025-02-08 14:11:46,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:46,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:46,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:11:46,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:11:46,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:46,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:11:47,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:47,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172251161] [2025-02-08 14:11:47,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172251161] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:47,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535932660] [2025-02-08 14:11:47,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:47,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:47,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:47,179 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:11:47,181 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:11:47,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:11:47,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:11:47,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:47,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:47,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 14:11:47,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:47,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:11:47,289 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:11:47,322 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:11:47,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:11:47,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:11:47,379 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:11:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:11:47,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:11:47,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:11:47,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-08 14:11:47,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:11:47,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-02-08 14:11:47,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-02-08 14:11:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:11:47,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535932660] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:11:47,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:11:47,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-02-08 14:11:47,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195400668] [2025-02-08 14:11:47,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:11:47,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:11:47,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:47,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:11:47,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=280, Unknown=1, NotChecked=0, Total=342 [2025-02-08 14:11:47,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 113 [2025-02-08 14:11:47,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 161 transitions, 941 flow. Second operand has 19 states, 19 states have (on average 57.26315789473684) internal successors, (1088), 19 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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:11:47,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:47,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 113 [2025-02-08 14:11:47,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:51,039 INFO L124 PetriNetUnfolderBase]: 35989/56455 cut-off events. [2025-02-08 14:11:51,039 INFO L125 PetriNetUnfolderBase]: For 58432/61526 co-relation queries the response was YES. [2025-02-08 14:11:51,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148548 conditions, 56455 events. 35989/56455 cut-off events. For 58432/61526 co-relation queries the response was YES. Maximal size of possible extension queue 2048. Compared 467852 event pairs, 3364 based on Foata normal form. 2154/54160 useless extension candidates. Maximal degree in co-relation 148427. Up to 43866 conditions per place. [2025-02-08 14:11:51,664 INFO L140 encePairwiseOnDemand]: 99/113 looper letters, 148 selfloop transitions, 34 changer transitions 0/228 dead transitions. [2025-02-08 14:11:51,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 228 transitions, 1609 flow [2025-02-08 14:11:51,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 14:11:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 14:11:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 731 transitions. [2025-02-08 14:11:51,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.588093322606597 [2025-02-08 14:11:51,667 INFO L175 Difference]: Start difference. First operand has 168 places, 161 transitions, 941 flow. Second operand 11 states and 731 transitions. [2025-02-08 14:11:51,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 228 transitions, 1609 flow [2025-02-08 14:11:52,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 228 transitions, 1524 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-08 14:11:52,227 INFO L231 Difference]: Finished difference. Result has 170 places, 162 transitions, 972 flow [2025-02-08 14:11:52,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=972, PETRI_PLACES=170, PETRI_TRANSITIONS=162} [2025-02-08 14:11:52,228 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 62 predicate places. [2025-02-08 14:11:52,228 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 162 transitions, 972 flow [2025-02-08 14:11:52,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 57.26315789473684) internal successors, (1088), 19 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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:11:52,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:52,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:52,234 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:11:52,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:52,429 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:52,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:52,429 INFO L85 PathProgramCache]: Analyzing trace with hash 410759190, now seen corresponding path program 1 times [2025-02-08 14:11:52,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:52,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191549986] [2025-02-08 14:11:52,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:52,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:52,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:11:52,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:11:52,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:52,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:52,497 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:11:52,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:52,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191549986] [2025-02-08 14:11:52,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191549986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:11:52,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:11:52,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:11:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362451871] [2025-02-08 14:11:52,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:11:52,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:11:52,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:52,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:11:52,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:11:52,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 113 [2025-02-08 14:11:52,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 162 transitions, 972 flow. Second operand has 5 states, 5 states have (on average 62.4) internal successors, (312), 5 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:11:52,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:52,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 113 [2025-02-08 14:11:52,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:11:55,320 INFO L124 PetriNetUnfolderBase]: 23915/46565 cut-off events. [2025-02-08 14:11:55,320 INFO L125 PetriNetUnfolderBase]: For 45889/48203 co-relation queries the response was YES. [2025-02-08 14:11:55,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113254 conditions, 46565 events. 23915/46565 cut-off events. For 45889/48203 co-relation queries the response was YES. Maximal size of possible extension queue 1800. Compared 477644 event pairs, 12958 based on Foata normal form. 2496/45566 useless extension candidates. Maximal degree in co-relation 113131. Up to 19881 conditions per place. [2025-02-08 14:11:55,713 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 156 selfloop transitions, 4 changer transitions 0/209 dead transitions. [2025-02-08 14:11:55,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 209 transitions, 1480 flow [2025-02-08 14:11:55,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:11:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:11:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 394 transitions. [2025-02-08 14:11:55,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6973451327433628 [2025-02-08 14:11:55,714 INFO L175 Difference]: Start difference. First operand has 170 places, 162 transitions, 972 flow. Second operand 5 states and 394 transitions. [2025-02-08 14:11:55,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 209 transitions, 1480 flow [2025-02-08 14:11:55,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 209 transitions, 1462 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:11:55,958 INFO L231 Difference]: Finished difference. Result has 172 places, 161 transitions, 965 flow [2025-02-08 14:11:55,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=965, PETRI_PLACES=172, PETRI_TRANSITIONS=161} [2025-02-08 14:11:55,959 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 64 predicate places. [2025-02-08 14:11:55,959 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 161 transitions, 965 flow [2025-02-08 14:11:55,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.4) internal successors, (312), 5 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:11:55,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:11:55,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:11:55,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 14:11:55,959 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:11:55,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:11:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash 697948442, now seen corresponding path program 1 times [2025-02-08 14:11:55,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:11:55,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324953225] [2025-02-08 14:11:55,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:55,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:11:55,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 14:11:55,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:11:55,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:55,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:11:56,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:11:56,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324953225] [2025-02-08 14:11:56,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324953225] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:11:56,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688075826] [2025-02-08 14:11:56,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:11:56,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:11:56,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:11:56,141 INFO L229 MonitoredProcess]: Starting monitored process 9 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:11:56,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 14:11:56,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 14:11:56,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:11:56,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:11:56,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:11:56,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 14:11:56,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:11:56,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:11:56,231 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:11:56,251 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:11:56,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:11:56,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 14:11:56,288 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:11:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:11:56,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:11:56,336 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_262 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_262) c_~B~0.base) c_~B~0.offset) 4294967296)) is different from false [2025-02-08 14:11:56,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:11:56,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-08 14:11:56,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:11:56,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2025-02-08 14:11:56,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-02-08 14:11:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-02-08 14:11:56,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688075826] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:11:56,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:11:56,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-02-08 14:11:56,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942416611] [2025-02-08 14:11:56,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:11:56,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:11:56,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:11:56,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:11:56,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=250, Unknown=1, NotChecked=32, Total=342 [2025-02-08 14:11:56,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 113 [2025-02-08 14:11:56,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 161 transitions, 965 flow. Second operand has 19 states, 19 states have (on average 57.26315789473684) internal successors, (1088), 19 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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:11:56,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:11:56,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 113 [2025-02-08 14:11:56,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:00,132 INFO L124 PetriNetUnfolderBase]: 34277/54313 cut-off events. [2025-02-08 14:12:00,132 INFO L125 PetriNetUnfolderBase]: For 47986/50878 co-relation queries the response was YES. [2025-02-08 14:12:00,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144226 conditions, 54313 events. 34277/54313 cut-off events. For 47986/50878 co-relation queries the response was YES. Maximal size of possible extension queue 1979. Compared 456655 event pairs, 2536 based on Foata normal form. 2650/52510 useless extension candidates. Maximal degree in co-relation 144103. Up to 41472 conditions per place. [2025-02-08 14:12:00,527 INFO L140 encePairwiseOnDemand]: 99/113 looper letters, 147 selfloop transitions, 34 changer transitions 0/226 dead transitions. [2025-02-08 14:12:00,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 226 transitions, 1603 flow [2025-02-08 14:12:00,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 14:12:00,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 14:12:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 730 transitions. [2025-02-08 14:12:00,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.587288817377313 [2025-02-08 14:12:00,533 INFO L175 Difference]: Start difference. First operand has 172 places, 161 transitions, 965 flow. Second operand 11 states and 730 transitions. [2025-02-08 14:12:00,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 226 transitions, 1603 flow [2025-02-08 14:12:00,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 226 transitions, 1588 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:12:00,962 INFO L231 Difference]: Finished difference. Result has 178 places, 160 transitions, 1022 flow [2025-02-08 14:12:00,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1022, PETRI_PLACES=178, PETRI_TRANSITIONS=160} [2025-02-08 14:12:00,963 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 70 predicate places. [2025-02-08 14:12:00,963 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 160 transitions, 1022 flow [2025-02-08 14:12:00,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 57.26315789473684) internal successors, (1088), 19 states have internal predecessors, (1088), 0 states have call successors, (0), 0 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:12:00,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:00,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:00,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 14:12:01,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 14:12:01,168 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:12:01,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:01,168 INFO L85 PathProgramCache]: Analyzing trace with hash -151366117, now seen corresponding path program 1 times [2025-02-08 14:12:01,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:01,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893728009] [2025-02-08 14:12:01,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:01,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:01,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 14:12:01,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:12:01,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:01,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:01,250 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:12:01,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:01,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893728009] [2025-02-08 14:12:01,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893728009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:01,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:01,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:12:01,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237477846] [2025-02-08 14:12:01,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:01,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:12:01,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:01,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:12:01,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:12:01,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 113 [2025-02-08 14:12:01,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 160 transitions, 1022 flow. Second operand has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 6 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:12:01,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:01,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 113 [2025-02-08 14:12:01,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:05,484 INFO L124 PetriNetUnfolderBase]: 32483/54795 cut-off events. [2025-02-08 14:12:05,484 INFO L125 PetriNetUnfolderBase]: For 59645/62465 co-relation queries the response was YES. [2025-02-08 14:12:05,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143318 conditions, 54795 events. 32483/54795 cut-off events. For 59645/62465 co-relation queries the response was YES. Maximal size of possible extension queue 2054. Compared 498915 event pairs, 4514 based on Foata normal form. 1968/53760 useless extension candidates. Maximal degree in co-relation 143192. Up to 17344 conditions per place. [2025-02-08 14:12:05,897 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 177 selfloop transitions, 7 changer transitions 0/231 dead transitions. [2025-02-08 14:12:05,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 231 transitions, 1688 flow [2025-02-08 14:12:05,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:12:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:12:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 455 transitions. [2025-02-08 14:12:05,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6710914454277286 [2025-02-08 14:12:05,899 INFO L175 Difference]: Start difference. First operand has 178 places, 160 transitions, 1022 flow. Second operand 6 states and 455 transitions. [2025-02-08 14:12:05,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 231 transitions, 1688 flow [2025-02-08 14:12:06,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 231 transitions, 1606 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-02-08 14:12:06,235 INFO L231 Difference]: Finished difference. Result has 175 places, 160 transitions, 973 flow [2025-02-08 14:12:06,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=973, PETRI_PLACES=175, PETRI_TRANSITIONS=160} [2025-02-08 14:12:06,237 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 67 predicate places. [2025-02-08 14:12:06,237 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 160 transitions, 973 flow [2025-02-08 14:12:06,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 6 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:12:06,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:06,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:06,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 14:12:06,238 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:12:06,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:06,238 INFO L85 PathProgramCache]: Analyzing trace with hash -661013250, now seen corresponding path program 1 times [2025-02-08 14:12:06,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:06,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841267769] [2025-02-08 14:12:06,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:06,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:06,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 14:12:06,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 14:12:06,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:06,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:06,277 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:12:06,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:06,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841267769] [2025-02-08 14:12:06,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841267769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:12:06,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:12:06,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:12:06,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164130258] [2025-02-08 14:12:06,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:12:06,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:12:06,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:06,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:12:06,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:12:06,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 113 [2025-02-08 14:12:06,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 160 transitions, 973 flow. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 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:12:06,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:06,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 113 [2025-02-08 14:12:06,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:10,022 INFO L124 PetriNetUnfolderBase]: 21251/46011 cut-off events. [2025-02-08 14:12:10,023 INFO L125 PetriNetUnfolderBase]: For 41359/43043 co-relation queries the response was YES. [2025-02-08 14:12:10,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110079 conditions, 46011 events. 21251/46011 cut-off events. For 41359/43043 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 518702 event pairs, 19398 based on Foata normal form. 1458/43112 useless extension candidates. Maximal degree in co-relation 109955. Up to 29828 conditions per place. [2025-02-08 14:12:10,299 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 106 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2025-02-08 14:12:10,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 156 transitions, 1181 flow [2025-02-08 14:12:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:12:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:12:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 292 transitions. [2025-02-08 14:12:10,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6460176991150443 [2025-02-08 14:12:10,301 INFO L175 Difference]: Start difference. First operand has 175 places, 160 transitions, 973 flow. Second operand 4 states and 292 transitions. [2025-02-08 14:12:10,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 156 transitions, 1181 flow [2025-02-08 14:12:10,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 156 transitions, 1169 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:12:10,604 INFO L231 Difference]: Finished difference. Result has 170 places, 156 transitions, 957 flow [2025-02-08 14:12:10,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=957, PETRI_PLACES=170, PETRI_TRANSITIONS=156} [2025-02-08 14:12:10,604 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 62 predicate places. [2025-02-08 14:12:10,604 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 156 transitions, 957 flow [2025-02-08 14:12:10,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 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:12:10,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:10,605 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1] [2025-02-08 14:12:10,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 14:12:10,605 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:12:10,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:10,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1059977939, now seen corresponding path program 2 times [2025-02-08 14:12:10,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:10,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371187744] [2025-02-08 14:12:10,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:12:10,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:10,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-08 14:12:10,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-02-08 14:12:10,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:12:10,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 14:12:10,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:10,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371187744] [2025-02-08 14:12:10,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371187744] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:10,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577005548] [2025-02-08 14:12:10,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:12:10,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:10,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:10,639 INFO L229 MonitoredProcess]: Starting monitored process 10 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:12:10,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 14:12:10,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-08 14:12:10,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 23 statements. [2025-02-08 14:12:10,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:12:10,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:10,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:12:10,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 14:12:10,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:10,739 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 14:12:10,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577005548] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:10,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:10,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-02-08 14:12:10,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253468806] [2025-02-08 14:12:10,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:10,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:12:10,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:10,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:12:10,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:12:10,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 113 [2025-02-08 14:12:10,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 156 transitions, 957 flow. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 0 states have call successors, (0), 0 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:12:10,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:10,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 113 [2025-02-08 14:12:10,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:12:14,230 INFO L124 PetriNetUnfolderBase]: 21251/46009 cut-off events. [2025-02-08 14:12:14,230 INFO L125 PetriNetUnfolderBase]: For 34347/36031 co-relation queries the response was YES. [2025-02-08 14:12:14,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107738 conditions, 46009 events. 21251/46009 cut-off events. For 34347/36031 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 518660 event pairs, 19398 based on Foata normal form. 1450/43102 useless extension candidates. Maximal degree in co-relation 107624. Up to 29805 conditions per place. [2025-02-08 14:12:14,502 INFO L140 encePairwiseOnDemand]: 103/113 looper letters, 64 selfloop transitions, 44 changer transitions 0/154 dead transitions. [2025-02-08 14:12:14,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 154 transitions, 1153 flow [2025-02-08 14:12:14,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:12:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:12:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 340 transitions. [2025-02-08 14:12:14,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6017699115044248 [2025-02-08 14:12:14,506 INFO L175 Difference]: Start difference. First operand has 170 places, 156 transitions, 957 flow. Second operand 5 states and 340 transitions. [2025-02-08 14:12:14,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 154 transitions, 1153 flow [2025-02-08 14:12:14,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 154 transitions, 1116 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 14:12:14,813 INFO L231 Difference]: Finished difference. Result has 166 places, 154 transitions, 988 flow [2025-02-08 14:12:14,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=988, PETRI_PLACES=166, PETRI_TRANSITIONS=154} [2025-02-08 14:12:14,813 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 58 predicate places. [2025-02-08 14:12:14,813 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 154 transitions, 988 flow [2025-02-08 14:12:14,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 0 states have call successors, (0), 0 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:12:14,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:12:14,814 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:12:14,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 14:12:15,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:15,015 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-02-08 14:12:15,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:12:15,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1470621233, now seen corresponding path program 1 times [2025-02-08 14:12:15,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:12:15,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309925747] [2025-02-08 14:12:15,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:12:15,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 14:12:15,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 14:12:15,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:15,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:15,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:12:15,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:12:15,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309925747] [2025-02-08 14:12:15,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309925747] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:12:15,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310307548] [2025-02-08 14:12:15,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:12:15,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:12:15,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:12:15,194 INFO L229 MonitoredProcess]: Starting monitored process 11 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:12:15,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 14:12:15,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 14:12:15,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 14:12:15,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:12:15,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:12:15,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 14:12:15,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:12:15,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 14:12:15,298 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:12:15,325 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 14:12:15,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 14:12:15,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 14:12:15,376 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:12:15,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:12:15,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:12:15,427 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_343) c_~B~0.base) c_~B~0.offset) 9223372039002259456))) is different from false [2025-02-08 14:12:15,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:12:15,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2025-02-08 14:12:15,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 14:12:15,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2025-02-08 14:12:15,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-02-08 14:12:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-02-08 14:12:15,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310307548] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:12:15,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:12:15,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-02-08 14:12:15,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009463574] [2025-02-08 14:12:15,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:12:15,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:12:15,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:12:15,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:12:15,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=250, Unknown=1, NotChecked=32, Total=342 [2025-02-08 14:12:15,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 113 [2025-02-08 14:12:15,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 154 transitions, 988 flow. Second operand has 19 states, 19 states have (on average 57.578947368421055) internal successors, (1094), 19 states have internal predecessors, (1094), 0 states have call successors, (0), 0 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:12:15,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:12:15,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 113 [2025-02-08 14:12:15,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand