./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/reorder_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/pthread/reorder_2.i -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 eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:29:46,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:29:46,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:29:46,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:29:46,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:29:46,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:29:46,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:29:46,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:29:46,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:29:46,941 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:29:46,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:29:46,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:29:46,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:29:46,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:29:46,941 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:29:46,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:29:46,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:29:46,941 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:29:46,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:29:46,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:29:46,942 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:29:46,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:29:46,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:29:46,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:29:46,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:29:46,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:29:46,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:29:46,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:29:46,943 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 -> eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 [2025-02-06 18:29:47,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:29:47,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:29:47,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:29:47,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:29:47,107 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:29:47,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_2.i [2025-02-06 18:29:48,249 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1c47b21f/a39ad86d8bc04f8f9014d05e0d01fa5c/FLAGb8f094e5b [2025-02-06 18:29:48,541 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:29:48,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/reorder_2.i [2025-02-06 18:29:48,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1c47b21f/a39ad86d8bc04f8f9014d05e0d01fa5c/FLAGb8f094e5b [2025-02-06 18:29:48,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f1c47b21f/a39ad86d8bc04f8f9014d05e0d01fa5c [2025-02-06 18:29:48,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:29:48,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:29:48,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:29:48,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:29:48,835 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:29:48,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:29:48" (1/1) ... [2025-02-06 18:29:48,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bcba181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:48, skipping insertion in model container [2025-02-06 18:29:48,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:29:48" (1/1) ... [2025-02-06 18:29:48,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:29:49,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:29:49,195 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:29:49,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:29:49,313 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:29:49,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:49 WrapperNode [2025-02-06 18:29:49,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:29:49,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:29:49,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:29:49,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:29:49,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:49" (1/1) ... [2025-02-06 18:29:49,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:49" (1/1) ... [2025-02-06 18:29:49,344 INFO L138 Inliner]: procedures = 372, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 133 [2025-02-06 18:29:49,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:29:49,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:29:49,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:29:49,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:29:49,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:49" (1/1) ... [2025-02-06 18:29:49,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:49" (1/1) ... [2025-02-06 18:29:49,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:49" (1/1) ... [2025-02-06 18:29:49,360 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-02-06 18:29:49,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:49" (1/1) ... [2025-02-06 18:29:49,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:49" (1/1) ... [2025-02-06 18:29:49,365 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:49" (1/1) ... [2025-02-06 18:29:49,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:49" (1/1) ... [2025-02-06 18:29:49,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:49" (1/1) ... [2025-02-06 18:29:49,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:49" (1/1) ... [2025-02-06 18:29:49,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:29:49,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:29:49,369 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:29:49,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:29:49,370 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:49" (1/1) ... [2025-02-06 18:29:49,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:29:49,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:29:49,392 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-06 18:29:49,394 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-06 18:29:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 18:29:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:29:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:29:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 18:29:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:29:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:29:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:29:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-02-06 18:29:49,410 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-02-06 18:29:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:29:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:29:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:29:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:29:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-02-06 18:29:49,410 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-02-06 18:29:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:29:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:29:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:29:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:29:49,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:29:49,411 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:29:49,493 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:29:49,495 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:29:49,638 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: havoc main_~#setPool~0#1.base, main_~#setPool~0#1.offset; [2025-02-06 18:29:49,638 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-1: SUMMARY for call ULTIMATE.dealloc(main_~#setPool~0#1.base, main_~#setPool~0#1.offset); srcloc: null [2025-02-06 18:29:49,638 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261: havoc main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset; [2025-02-06 18:29:49,638 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-1: SUMMARY for call ULTIMATE.dealloc(main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset); srcloc: null [2025-02-06 18:29:49,639 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:29:49,640 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:29:49,791 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:29:49,791 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:29:49,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:29:49 BoogieIcfgContainer [2025-02-06 18:29:49,792 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:29:49,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:29:49,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:29:49,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:29:49,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:29:48" (1/3) ... [2025-02-06 18:29:49,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e55d197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:29:49, skipping insertion in model container [2025-02-06 18:29:49,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:49" (2/3) ... [2025-02-06 18:29:49,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e55d197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:29:49, skipping insertion in model container [2025-02-06 18:29:49,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:29:49" (3/3) ... [2025-02-06 18:29:49,798 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_2.i [2025-02-06 18:29:49,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:29:49,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_2.i that has 3 procedures, 40 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-02-06 18:29:49,813 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:29:49,872 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 18:29:49,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 110 flow [2025-02-06 18:29:49,973 INFO L124 PetriNetUnfolderBase]: 8/100 cut-off events. [2025-02-06 18:29:49,974 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 18:29:49,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 100 events. 8/100 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 370 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 50. Up to 7 conditions per place. [2025-02-06 18:29:49,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 45 transitions, 110 flow [2025-02-06 18:29:49,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 108 flow [2025-02-06 18:29:49,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:29:49,992 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;@4f7502be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:29:49,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 18:29:49,997 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:29:49,997 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-02-06 18:29:49,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:29:49,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:49,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:29:49,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:29:50,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:50,002 INFO L85 PathProgramCache]: Analyzing trace with hash 320789903, now seen corresponding path program 1 times [2025-02-06 18:29:50,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:50,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239248380] [2025-02-06 18:29:50,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:50,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:50,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:29:50,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:29:50,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:50,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:50,222 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-06 18:29:50,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:50,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239248380] [2025-02-06 18:29:50,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239248380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:50,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:50,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:29:50,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481294626] [2025-02-06 18:29:50,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:50,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:50,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:50,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:50,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:50,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2025-02-06 18:29:50,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-06 18:29:50,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:50,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2025-02-06 18:29:50,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:50,408 INFO L124 PetriNetUnfolderBase]: 294/690 cut-off events. [2025-02-06 18:29:50,409 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 18:29:50,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 690 events. 294/690 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3574 event pairs, 195 based on Foata normal form. 4/600 useless extension candidates. Maximal degree in co-relation 957. Up to 406 conditions per place. [2025-02-06 18:29:50,416 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 41 selfloop transitions, 8 changer transitions 2/65 dead transitions. [2025-02-06 18:29:50,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 264 flow [2025-02-06 18:29:50,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-02-06 18:29:50,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-06 18:29:50,429 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 108 flow. Second operand 4 states and 108 transitions. [2025-02-06 18:29:50,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 264 flow [2025-02-06 18:29:50,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:29:50,437 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 136 flow [2025-02-06 18:29:50,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-02-06 18:29:50,444 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2025-02-06 18:29:50,446 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 136 flow [2025-02-06 18:29:50,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-06 18:29:50,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:50,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:29:50,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:29:50,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:29:50,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1352516701, now seen corresponding path program 1 times [2025-02-06 18:29:50,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:50,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984200269] [2025-02-06 18:29:50,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:50,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:29:50,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:29:50,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:50,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:50,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:50,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984200269] [2025-02-06 18:29:50,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984200269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:50,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:50,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141509573] [2025-02-06 18:29:50,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:50,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:50,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:50,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:50,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:50,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2025-02-06 18:29:50,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-06 18:29:50,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:50,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2025-02-06 18:29:50,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:50,737 INFO L124 PetriNetUnfolderBase]: 289/685 cut-off events. [2025-02-06 18:29:50,737 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2025-02-06 18:29:50,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 685 events. 289/685 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3600 event pairs, 165 based on Foata normal form. 40/699 useless extension candidates. Maximal degree in co-relation 1043. Up to 352 conditions per place. [2025-02-06 18:29:50,746 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 44 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2025-02-06 18:29:50,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 296 flow [2025-02-06 18:29:50,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-02-06 18:29:50,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-02-06 18:29:50,747 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 136 flow. Second operand 4 states and 111 transitions. [2025-02-06 18:29:50,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 296 flow [2025-02-06 18:29:50,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 294 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:29:50,750 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 160 flow [2025-02-06 18:29:50,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2025-02-06 18:29:50,751 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2025-02-06 18:29:50,751 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 160 flow [2025-02-06 18:29:50,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-06 18:29:50,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:50,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:29:50,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:29:50,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:29:50,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:50,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1354552669, now seen corresponding path program 1 times [2025-02-06 18:29:50,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:50,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280207503] [2025-02-06 18:29:50,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:50,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:50,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:29:50,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:29:50,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:50,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:50,853 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-06 18:29:50,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:50,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280207503] [2025-02-06 18:29:50,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280207503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:50,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:50,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:29:50,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392597498] [2025-02-06 18:29:50,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:50,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:50,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:50,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:50,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:50,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2025-02-06 18:29:50,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-06 18:29:50,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:50,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2025-02-06 18:29:50,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:50,978 INFO L124 PetriNetUnfolderBase]: 289/671 cut-off events. [2025-02-06 18:29:50,979 INFO L125 PetriNetUnfolderBase]: For 464/464 co-relation queries the response was YES. [2025-02-06 18:29:51,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 671 events. 289/671 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3442 event pairs, 189 based on Foata normal form. 4/653 useless extension candidates. Maximal degree in co-relation 1119. Up to 392 conditions per place. [2025-02-06 18:29:51,004 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 41 selfloop transitions, 9 changer transitions 0/62 dead transitions. [2025-02-06 18:29:51,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 308 flow [2025-02-06 18:29:51,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-02-06 18:29:51,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2025-02-06 18:29:51,005 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 160 flow. Second operand 4 states and 107 transitions. [2025-02-06 18:29:51,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 308 flow [2025-02-06 18:29:51,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:29:51,008 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 174 flow [2025-02-06 18:29:51,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2025-02-06 18:29:51,009 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2025-02-06 18:29:51,009 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 174 flow [2025-02-06 18:29:51,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-06 18:29:51,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:51,009 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:51,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:29:51,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:29:51,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash 350035123, now seen corresponding path program 1 times [2025-02-06 18:29:51,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:51,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18445479] [2025-02-06 18:29:51,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:51,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:51,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:29:51,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:29:51,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:51,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:29:51,031 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:29:51,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:29:51,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:29:51,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:51,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:29:51,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:29:51,053 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:29:51,054 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-06 18:29:51,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-02-06 18:29:51,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-02-06 18:29:51,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-02-06 18:29:51,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-02-06 18:29:51,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-02-06 18:29:51,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-02-06 18:29:51,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-02-06 18:29:51,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-02-06 18:29:51,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-02-06 18:29:51,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:29:51,056 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 18:29:51,058 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:29:51,058 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 18:29:51,073 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-02-06 18:29:51,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 59 transitions, 162 flow [2025-02-06 18:29:51,101 INFO L124 PetriNetUnfolderBase]: 57/387 cut-off events. [2025-02-06 18:29:51,101 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-02-06 18:29:51,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 387 events. 57/387 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2200 event pairs, 1 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 237. Up to 32 conditions per place. [2025-02-06 18:29:51,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 59 transitions, 162 flow [2025-02-06 18:29:51,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 58 transitions, 160 flow [2025-02-06 18:29:51,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:29:51,104 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;@4f7502be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:29:51,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 18:29:51,106 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:29:51,106 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-02-06 18:29:51,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:29:51,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:51,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:29:51,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:29:51,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash 375192976, now seen corresponding path program 1 times [2025-02-06 18:29:51,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:51,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693594708] [2025-02-06 18:29:51,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:51,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:51,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:29:51,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:29:51,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:51,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:51,143 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-06 18:29:51,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:51,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693594708] [2025-02-06 18:29:51,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693594708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:51,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:51,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:29:51,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659435046] [2025-02-06 18:29:51,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:51,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:51,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:51,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:51,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:51,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-02-06 18:29:51,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-06 18:29:51,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:51,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-02-06 18:29:51,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:52,890 INFO L124 PetriNetUnfolderBase]: 16800/27838 cut-off events. [2025-02-06 18:29:52,890 INFO L125 PetriNetUnfolderBase]: For 2320/2320 co-relation queries the response was YES. [2025-02-06 18:29:52,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53646 conditions, 27838 events. 16800/27838 cut-off events. For 2320/2320 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 217535 event pairs, 8229 based on Foata normal form. 20/25428 useless extension candidates. Maximal degree in co-relation 14165. Up to 12736 conditions per place. [2025-02-06 18:29:53,078 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 70 selfloop transitions, 8 changer transitions 0/94 dead transitions. [2025-02-06 18:29:53,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 412 flow [2025-02-06 18:29:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2025-02-06 18:29:53,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6059322033898306 [2025-02-06 18:29:53,084 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 160 flow. Second operand 4 states and 143 transitions. [2025-02-06 18:29:53,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 412 flow [2025-02-06 18:29:53,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 94 transitions, 412 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:29:53,095 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 208 flow [2025-02-06 18:29:53,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2025-02-06 18:29:53,097 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2025-02-06 18:29:53,097 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 208 flow [2025-02-06 18:29:53,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-06 18:29:53,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:53,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:29:53,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:29:53,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:29:53,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:53,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1256184954, now seen corresponding path program 1 times [2025-02-06 18:29:53,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:53,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697899678] [2025-02-06 18:29:53,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:53,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:53,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:29:53,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:29:53,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:53,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:53,194 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-06 18:29:53,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:53,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697899678] [2025-02-06 18:29:53,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697899678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:53,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:53,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:53,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810773513] [2025-02-06 18:29:53,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:53,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:53,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:53,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:53,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:53,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-02-06 18:29:53,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:53,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:53,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-02-06 18:29:53,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:54,674 INFO L124 PetriNetUnfolderBase]: 18645/29857 cut-off events. [2025-02-06 18:29:54,674 INFO L125 PetriNetUnfolderBase]: For 6857/6857 co-relation queries the response was YES. [2025-02-06 18:29:54,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62440 conditions, 29857 events. 18645/29857 cut-off events. For 6857/6857 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 226486 event pairs, 8637 based on Foata normal form. 168/29051 useless extension candidates. Maximal degree in co-relation 35561. Up to 14005 conditions per place. [2025-02-06 18:29:54,820 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 77 selfloop transitions, 9 changer transitions 0/101 dead transitions. [2025-02-06 18:29:54,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 101 transitions, 488 flow [2025-02-06 18:29:54,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2025-02-06 18:29:54,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2025-02-06 18:29:54,821 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 208 flow. Second operand 4 states and 152 transitions. [2025-02-06 18:29:54,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 101 transitions, 488 flow [2025-02-06 18:29:54,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 101 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:29:54,827 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 260 flow [2025-02-06 18:29:54,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-02-06 18:29:54,828 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 9 predicate places. [2025-02-06 18:29:54,828 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 260 flow [2025-02-06 18:29:54,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:54,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:54,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:29:54,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:29:54,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:29:54,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:54,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1253919307, now seen corresponding path program 1 times [2025-02-06 18:29:54,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:54,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923261084] [2025-02-06 18:29:54,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:54,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:54,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:29:54,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:29:54,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:54,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:54,888 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-06 18:29:54,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:54,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923261084] [2025-02-06 18:29:54,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923261084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:54,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:54,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:29:54,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736683276] [2025-02-06 18:29:54,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:54,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:54,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:54,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:54,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:54,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-02-06 18:29:54,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-06 18:29:54,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:54,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-02-06 18:29:54,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:56,442 INFO L124 PetriNetUnfolderBase]: 16797/27488 cut-off events. [2025-02-06 18:29:56,443 INFO L125 PetriNetUnfolderBase]: For 16293/16293 co-relation queries the response was YES. [2025-02-06 18:29:56,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61519 conditions, 27488 events. 16797/27488 cut-off events. For 16293/16293 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 212266 event pairs, 7117 based on Foata normal form. 4/26540 useless extension candidates. Maximal degree in co-relation 34813. Up to 12614 conditions per place. [2025-02-06 18:29:56,549 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 70 selfloop transitions, 9 changer transitions 0/95 dead transitions. [2025-02-06 18:29:56,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 95 transitions, 504 flow [2025-02-06 18:29:56,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-02-06 18:29:56,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6101694915254238 [2025-02-06 18:29:56,551 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 260 flow. Second operand 4 states and 144 transitions. [2025-02-06 18:29:56,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 95 transitions, 504 flow [2025-02-06 18:29:56,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 95 transitions, 504 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:29:56,562 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 296 flow [2025-02-06 18:29:56,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2025-02-06 18:29:56,562 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 14 predicate places. [2025-02-06 18:29:56,562 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 296 flow [2025-02-06 18:29:56,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-06 18:29:56,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:56,563 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:56,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:29:56,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:29:56,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:56,563 INFO L85 PathProgramCache]: Analyzing trace with hash 815771315, now seen corresponding path program 1 times [2025-02-06 18:29:56,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:56,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325824796] [2025-02-06 18:29:56,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:56,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:56,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:29:56,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:29:56,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:56,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:56,650 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-06 18:29:56,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:56,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325824796] [2025-02-06 18:29:56,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325824796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:56,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:56,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:29:56,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062269079] [2025-02-06 18:29:56,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:56,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:29:56,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:56,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:29:56,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:29:56,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-02-06 18:29:56,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:56,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:56,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-02-06 18:29:56,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:58,109 INFO L124 PetriNetUnfolderBase]: 17709/28911 cut-off events. [2025-02-06 18:29:58,110 INFO L125 PetriNetUnfolderBase]: For 24051/24051 co-relation queries the response was YES. [2025-02-06 18:29:58,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66767 conditions, 28911 events. 17709/28911 cut-off events. For 24051/24051 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 224688 event pairs, 5745 based on Foata normal form. 336/28298 useless extension candidates. Maximal degree in co-relation 50745. Up to 12366 conditions per place. [2025-02-06 18:29:58,258 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 98 selfloop transitions, 11 changer transitions 0/124 dead transitions. [2025-02-06 18:29:58,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 124 transitions, 652 flow [2025-02-06 18:29:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:29:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:29:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2025-02-06 18:29:58,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5819209039548022 [2025-02-06 18:29:58,260 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 296 flow. Second operand 6 states and 206 transitions. [2025-02-06 18:29:58,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 124 transitions, 652 flow [2025-02-06 18:29:58,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 124 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:29:58,277 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 296 flow [2025-02-06 18:29:58,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2025-02-06 18:29:58,278 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 16 predicate places. [2025-02-06 18:29:58,278 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 296 flow [2025-02-06 18:29:58,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:58,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:58,278 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:29:58,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:29:58,279 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:29:58,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:58,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1822830952, now seen corresponding path program 1 times [2025-02-06 18:29:58,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:58,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105152881] [2025-02-06 18:29:58,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:58,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:58,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:29:58,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:29:58,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:58,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:58,342 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-06 18:29:58,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:58,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105152881] [2025-02-06 18:29:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105152881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:58,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:58,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:29:58,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780440830] [2025-02-06 18:29:58,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:58,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:29:58,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:58,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:29:58,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:29:58,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-02-06 18:29:58,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-06 18:29:58,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:58,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-02-06 18:29:58,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:00,145 INFO L124 PetriNetUnfolderBase]: 16773/27587 cut-off events. [2025-02-06 18:30:00,146 INFO L125 PetriNetUnfolderBase]: For 24493/24493 co-relation queries the response was YES. [2025-02-06 18:30:00,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64751 conditions, 27587 events. 16773/27587 cut-off events. For 24493/24493 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 214670 event pairs, 6081 based on Foata normal form. 16/26655 useless extension candidates. Maximal degree in co-relation 49312. Up to 12614 conditions per place. [2025-02-06 18:30:00,263 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 80 selfloop transitions, 12 changer transitions 0/107 dead transitions. [2025-02-06 18:30:00,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 107 transitions, 594 flow [2025-02-06 18:30:00,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:30:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:30:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2025-02-06 18:30:00,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5338983050847458 [2025-02-06 18:30:00,266 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 296 flow. Second operand 6 states and 189 transitions. [2025-02-06 18:30:00,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 107 transitions, 594 flow [2025-02-06 18:30:00,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 107 transitions, 568 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 18:30:00,281 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 300 flow [2025-02-06 18:30:00,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2025-02-06 18:30:00,282 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 16 predicate places. [2025-02-06 18:30:00,282 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 300 flow [2025-02-06 18:30:00,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-06 18:30:00,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:00,283 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:30:00,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:30:00,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:30:00,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash -480892670, now seen corresponding path program 1 times [2025-02-06 18:30:00,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:00,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872772811] [2025-02-06 18:30:00,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:00,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:00,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:30:00,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:30:00,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:00,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:00,333 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-06 18:30:00,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872772811] [2025-02-06 18:30:00,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872772811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:00,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:00,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:30:00,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105499688] [2025-02-06 18:30:00,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:00,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:30:00,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:00,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:30:00,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:30:00,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2025-02-06 18:30:00,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:00,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:00,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2025-02-06 18:30:00,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:01,555 INFO L124 PetriNetUnfolderBase]: 16773/27799 cut-off events. [2025-02-06 18:30:01,555 INFO L125 PetriNetUnfolderBase]: For 20911/20911 co-relation queries the response was YES. [2025-02-06 18:30:01,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64070 conditions, 27799 events. 16773/27799 cut-off events. For 20911/20911 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 218405 event pairs, 5625 based on Foata normal form. 336/27182 useless extension candidates. Maximal degree in co-relation 36311. Up to 12366 conditions per place. [2025-02-06 18:30:01,887 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 98 selfloop transitions, 13 changer transitions 0/125 dead transitions. [2025-02-06 18:30:01,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 125 transitions, 675 flow [2025-02-06 18:30:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:30:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:30:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2025-02-06 18:30:01,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5847457627118644 [2025-02-06 18:30:01,889 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 300 flow. Second operand 6 states and 207 transitions. [2025-02-06 18:30:01,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 125 transitions, 675 flow [2025-02-06 18:30:01,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 637 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-02-06 18:30:01,911 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 297 flow [2025-02-06 18:30:01,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2025-02-06 18:30:01,913 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 15 predicate places. [2025-02-06 18:30:01,913 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 297 flow [2025-02-06 18:30:01,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:01,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:01,913 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-06 18:30:01,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:30:01,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:30:01,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:01,913 INFO L85 PathProgramCache]: Analyzing trace with hash -606099162, now seen corresponding path program 1 times [2025-02-06 18:30:01,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:01,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001155100] [2025-02-06 18:30:01,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:01,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:01,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:30:01,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:30:01,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:01,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:30:01,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:30:01,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:30:01,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:30:01,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:01,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:30:01,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:30:01,939 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 18:30:01,939 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-06 18:30:01,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-02-06 18:30:01,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-02-06 18:30:01,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-02-06 18:30:01,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-02-06 18:30:01,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-02-06 18:30:01,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-02-06 18:30:01,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-02-06 18:30:01,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-02-06 18:30:01,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-02-06 18:30:01,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:30:01,940 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:30:01,941 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 18:30:01,941 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 18:30:01,956 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-02-06 18:30:01,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 73 transitions, 218 flow [2025-02-06 18:30:02,008 INFO L124 PetriNetUnfolderBase]: 336/1466 cut-off events. [2025-02-06 18:30:02,008 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-02-06 18:30:02,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1902 conditions, 1466 events. 336/1466 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 10407 event pairs, 32 based on Foata normal form. 0/1036 useless extension candidates. Maximal degree in co-relation 941. Up to 192 conditions per place. [2025-02-06 18:30:02,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 73 transitions, 218 flow [2025-02-06 18:30:02,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 72 transitions, 216 flow [2025-02-06 18:30:02,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:30:02,014 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;@4f7502be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:30:02,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 18:30:02,016 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:30:02,016 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-02-06 18:30:02,016 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:30:02,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:02,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:30:02,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 18:30:02,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:02,016 INFO L85 PathProgramCache]: Analyzing trace with hash 442956319, now seen corresponding path program 1 times [2025-02-06 18:30:02,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:02,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966796867] [2025-02-06 18:30:02,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:02,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:02,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:30:02,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:30:02,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:02,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:02,042 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-06 18:30:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:02,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966796867] [2025-02-06 18:30:02,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966796867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:02,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:02,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:30:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098071481] [2025-02-06 18:30:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:02,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:30:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:02,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:30:02,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:30:02,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 73 [2025-02-06 18:30:02,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-06 18:30:02,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:02,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 73 [2025-02-06 18:30:02,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand