./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:29:33,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:29:33,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:29:33,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:29:33,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:29:33,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:29:33,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:29:33,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:29:33,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:29:33,136 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:29:33,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:29:33,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:29:33,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:29:33,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:29:33,137 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:29:33,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:29:33,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:29:33,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:29:33,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:29:33,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:29:33,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:29:33,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:29:33,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:29:33,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:29:33,138 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:29:33,138 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:29:33,138 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:29:33,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:29:33,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:29:33,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:29:33,139 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:29:33,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:29:33,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:29:33,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:29:33,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:33,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:29:33,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:29:33,140 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:29:33,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:29:33,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:29:33,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:29:33,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:29:33,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:29:33,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:29:33,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:29:33,140 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2025-03-04 15:29:33,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:29:33,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:29:33,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:29:33,363 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:29:33,363 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:29:33,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2025-03-04 15:29:34,516 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc11c30f/b2b0281c3d104d2aba9d99741489ad21/FLAGac0dd2319 [2025-03-04 15:29:34,787 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:29:34,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2025-03-04 15:29:34,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc11c30f/b2b0281c3d104d2aba9d99741489ad21/FLAGac0dd2319 [2025-03-04 15:29:35,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc11c30f/b2b0281c3d104d2aba9d99741489ad21 [2025-03-04 15:29:35,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:29:35,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:29:35,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:35,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:29:35,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:29:35,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:35" (1/1) ... [2025-03-04 15:29:35,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727dc406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35, skipping insertion in model container [2025-03-04 15:29:35,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:29:35" (1/1) ... [2025-03-04 15:29:35,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:29:35,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:35,247 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:29:35,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:29:35,276 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:29:35,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35 WrapperNode [2025-03-04 15:29:35,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:29:35,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:35,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:29:35,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:29:35,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35" (1/1) ... [2025-03-04 15:29:35,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35" (1/1) ... [2025-03-04 15:29:35,307 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 20, statements flattened = 284 [2025-03-04 15:29:35,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:29:35,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:29:35,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:29:35,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:29:35,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35" (1/1) ... [2025-03-04 15:29:35,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35" (1/1) ... [2025-03-04 15:29:35,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35" (1/1) ... [2025-03-04 15:29:35,331 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 15:29:35,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35" (1/1) ... [2025-03-04 15:29:35,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35" (1/1) ... [2025-03-04 15:29:35,337 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35" (1/1) ... [2025-03-04 15:29:35,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35" (1/1) ... [2025-03-04 15:29:35,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35" (1/1) ... [2025-03-04 15:29:35,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35" (1/1) ... [2025-03-04 15:29:35,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:29:35,342 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:29:35,342 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:29:35,342 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:29:35,343 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35" (1/1) ... [2025-03-04 15:29:35,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:29:35,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:35,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:29:35,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:29:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:29:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:29:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:29:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:29:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:29:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:29:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:29:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:29:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:29:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:29:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:29:35,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:29:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:29:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:29:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:29:35,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:29:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:29:35,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:29:35,391 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:29:35,481 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:29:35,483 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:29:35,920 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:29:35,920 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:29:36,240 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:29:36,240 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:29:36,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:36 BoogieIcfgContainer [2025-03-04 15:29:36,240 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:29:36,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:29:36,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:29:36,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:29:36,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:29:35" (1/3) ... [2025-03-04 15:29:36,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6423a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:36, skipping insertion in model container [2025-03-04 15:29:36,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:29:35" (2/3) ... [2025-03-04 15:29:36,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6423a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:29:36, skipping insertion in model container [2025-03-04 15:29:36,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:29:36" (3/3) ... [2025-03-04 15:29:36,248 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2025-03-04 15:29:36,261 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:29:36,263 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-mts.wvr.c that has 4 procedures, 107 locations, 1 initial locations, 4 loop locations, and 42 error locations. [2025-03-04 15:29:36,263 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:29:36,417 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:29:36,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 117 transitions, 255 flow [2025-03-04 15:29:36,480 INFO L124 PetriNetUnfolderBase]: 11/114 cut-off events. [2025-03-04 15:29:36,481 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:29:36,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 11/114 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 474 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2025-03-04 15:29:36,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 117 transitions, 255 flow [2025-03-04 15:29:36,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 111 transitions, 240 flow [2025-03-04 15:29:36,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:29:36,505 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;@48144bf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:29:36,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2025-03-04 15:29:36,508 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:29:36,508 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:29:36,508 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:29:36,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:36,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:29:36,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2025-03-04 15:29:36,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:36,512 INFO L85 PathProgramCache]: Analyzing trace with hash 883482, now seen corresponding path program 1 times [2025-03-04 15:29:36,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:36,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253408788] [2025-03-04 15:29:36,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:36,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:36,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:29:36,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:29:36,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:36,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:36,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:36,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253408788] [2025-03-04 15:29:36,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253408788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:36,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:36,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:36,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389383622] [2025-03-04 15:29:36,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:36,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:36,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:36,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:36,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:36,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 117 [2025-03-04 15:29:36,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 111 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:36,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:36,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 117 [2025-03-04 15:29:36,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:38,523 INFO L124 PetriNetUnfolderBase]: 9525/16709 cut-off events. [2025-03-04 15:29:38,523 INFO L125 PetriNetUnfolderBase]: For 482/482 co-relation queries the response was YES. [2025-03-04 15:29:38,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29916 conditions, 16709 events. 9525/16709 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 138862 event pairs, 7074 based on Foata normal form. 1/12363 useless extension candidates. Maximal degree in co-relation 28866. Up to 12796 conditions per place. [2025-03-04 15:29:38,650 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 50 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2025-03-04 15:29:38,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 106 transitions, 338 flow [2025-03-04 15:29:38,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 284 transitions. [2025-03-04 15:29:38,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6068376068376068 [2025-03-04 15:29:38,668 INFO L175 Difference]: Start difference. First operand has 111 places, 111 transitions, 240 flow. Second operand 4 states and 284 transitions. [2025-03-04 15:29:38,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 106 transitions, 338 flow [2025-03-04 15:29:38,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 106 transitions, 326 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:29:38,688 INFO L231 Difference]: Finished difference. Result has 102 places, 106 transitions, 241 flow [2025-03-04 15:29:38,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=102, PETRI_TRANSITIONS=106} [2025-03-04 15:29:38,692 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -9 predicate places. [2025-03-04 15:29:38,693 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 106 transitions, 241 flow [2025-03-04 15:29:38,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:38,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:38,694 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:29:38,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:29:38,695 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2025-03-04 15:29:38,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash 550763194, now seen corresponding path program 1 times [2025-03-04 15:29:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:38,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736743051] [2025-03-04 15:29:38,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:38,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:38,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:29:38,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:29:38,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:38,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:38,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:38,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736743051] [2025-03-04 15:29:38,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736743051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:38,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042249979] [2025-03-04 15:29:38,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:38,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:38,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:38,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:38,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:29:38,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:29:38,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:29:38,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:38,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:38,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:38,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:38,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:29:38,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042249979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:38,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:29:38,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:29:38,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578080350] [2025-03-04 15:29:38,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:38,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:29:38,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:38,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:29:38,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:29:38,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 117 [2025-03-04 15:29:38,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 106 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:38,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:38,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 117 [2025-03-04 15:29:38,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:40,127 INFO L124 PetriNetUnfolderBase]: 9525/16708 cut-off events. [2025-03-04 15:29:40,127 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-03-04 15:29:40,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29657 conditions, 16708 events. 9525/16708 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 138537 event pairs, 7074 based on Foata normal form. 1/12363 useless extension candidates. Maximal degree in co-relation 29630. Up to 12791 conditions per place. [2025-03-04 15:29:40,207 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 46 selfloop transitions, 7 changer transitions 0/105 dead transitions. [2025-03-04 15:29:40,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 105 transitions, 343 flow [2025-03-04 15:29:40,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:29:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:29:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 384 transitions. [2025-03-04 15:29:40,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5470085470085471 [2025-03-04 15:29:40,211 INFO L175 Difference]: Start difference. First operand has 102 places, 106 transitions, 241 flow. Second operand 6 states and 384 transitions. [2025-03-04 15:29:40,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 105 transitions, 343 flow [2025-03-04 15:29:40,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 105 transitions, 340 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:29:40,213 INFO L231 Difference]: Finished difference. Result has 105 places, 105 transitions, 248 flow [2025-03-04 15:29:40,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=105, PETRI_TRANSITIONS=105} [2025-03-04 15:29:40,214 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -6 predicate places. [2025-03-04 15:29:40,215 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 105 transitions, 248 flow [2025-03-04 15:29:40,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:40,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:40,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:40,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:29:40,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:40,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2025-03-04 15:29:40,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:40,417 INFO L85 PathProgramCache]: Analyzing trace with hash 97951480, now seen corresponding path program 1 times [2025-03-04 15:29:40,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:40,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438629741] [2025-03-04 15:29:40,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:40,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:40,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:40,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:40,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:40,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:40,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:40,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438629741] [2025-03-04 15:29:40,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438629741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:40,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:40,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:40,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5273896] [2025-03-04 15:29:40,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:40,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:40,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:40,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:40,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:40,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 117 [2025-03-04 15:29:40,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 105 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:40,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:40,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 117 [2025-03-04 15:29:40,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:42,090 INFO L124 PetriNetUnfolderBase]: 14819/25469 cut-off events. [2025-03-04 15:29:42,091 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-03-04 15:29:42,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45680 conditions, 25469 events. 14819/25469 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 1359. Compared 221676 event pairs, 6492 based on Foata normal form. 532/19088 useless extension candidates. Maximal degree in co-relation 45650. Up to 11850 conditions per place. [2025-03-04 15:29:42,203 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 112 selfloop transitions, 5 changer transitions 0/164 dead transitions. [2025-03-04 15:29:42,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 164 transitions, 604 flow [2025-03-04 15:29:42,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 321 transitions. [2025-03-04 15:29:42,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6858974358974359 [2025-03-04 15:29:42,205 INFO L175 Difference]: Start difference. First operand has 105 places, 105 transitions, 248 flow. Second operand 4 states and 321 transitions. [2025-03-04 15:29:42,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 164 transitions, 604 flow [2025-03-04 15:29:42,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 164 transitions, 582 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 15:29:42,207 INFO L231 Difference]: Finished difference. Result has 105 places, 107 transitions, 260 flow [2025-03-04 15:29:42,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=105, PETRI_TRANSITIONS=107} [2025-03-04 15:29:42,208 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -6 predicate places. [2025-03-04 15:29:42,209 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 107 transitions, 260 flow [2025-03-04 15:29:42,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:42,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:42,209 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:29:42,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:29:42,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2025-03-04 15:29:42,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:42,210 INFO L85 PathProgramCache]: Analyzing trace with hash -106209412, now seen corresponding path program 1 times [2025-03-04 15:29:42,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:42,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954552962] [2025-03-04 15:29:42,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:42,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:42,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:42,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:42,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:42,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:42,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954552962] [2025-03-04 15:29:42,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954552962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:42,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525259506] [2025-03-04 15:29:42,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:42,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:42,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:42,306 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:42,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:29:42,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:29:42,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:29:42,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:42,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:42,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:29:42,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:42,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:42,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:42,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525259506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:42,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:42,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:29:42,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392903370] [2025-03-04 15:29:42,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:42,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:29:42,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:42,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:29:42,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:29:42,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 117 [2025-03-04 15:29:42,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 107 transitions, 260 flow. Second operand has 12 states, 12 states have (on average 56.083333333333336) internal successors, (673), 12 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:42,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:42,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 117 [2025-03-04 15:29:42,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:43,670 INFO L124 PetriNetUnfolderBase]: 10964/20084 cut-off events. [2025-03-04 15:29:43,671 INFO L125 PetriNetUnfolderBase]: For 3266/3778 co-relation queries the response was YES. [2025-03-04 15:29:43,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37562 conditions, 20084 events. 10964/20084 cut-off events. For 3266/3778 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 180898 event pairs, 8278 based on Foata normal form. 260/15404 useless extension candidates. Maximal degree in co-relation 37510. Up to 14766 conditions per place. [2025-03-04 15:29:43,764 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 51 selfloop transitions, 13 changer transitions 0/116 dead transitions. [2025-03-04 15:29:43,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 116 transitions, 418 flow [2025-03-04 15:29:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 615 transitions. [2025-03-04 15:29:43,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2025-03-04 15:29:43,767 INFO L175 Difference]: Start difference. First operand has 105 places, 107 transitions, 260 flow. Second operand 10 states and 615 transitions. [2025-03-04 15:29:43,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 116 transitions, 418 flow [2025-03-04 15:29:43,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 116 transitions, 418 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:29:43,788 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 334 flow [2025-03-04 15:29:43,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=334, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2025-03-04 15:29:43,790 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 6 predicate places. [2025-03-04 15:29:43,790 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 334 flow [2025-03-04 15:29:43,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 56.083333333333336) internal successors, (673), 12 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:43,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:43,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:43,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:29:43,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 15:29:43,994 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2025-03-04 15:29:43,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:43,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1258470555, now seen corresponding path program 1 times [2025-03-04 15:29:43,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:43,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481737065] [2025-03-04 15:29:43,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:43,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:44,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:29:44,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:29:44,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:44,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:44,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481737065] [2025-03-04 15:29:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481737065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:44,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:44,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:29:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824985066] [2025-03-04 15:29:44,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:44,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:29:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:44,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:29:44,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:29:44,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 117 [2025-03-04 15:29:44,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:44,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:44,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 117 [2025-03-04 15:29:44,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:45,574 INFO L124 PetriNetUnfolderBase]: 10963/20083 cut-off events. [2025-03-04 15:29:45,575 INFO L125 PetriNetUnfolderBase]: For 3282/3794 co-relation queries the response was YES. [2025-03-04 15:29:45,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37584 conditions, 20083 events. 10963/20083 cut-off events. For 3282/3794 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 180788 event pairs, 8278 based on Foata normal form. 258/15404 useless extension candidates. Maximal degree in co-relation 37547. Up to 14770 conditions per place. [2025-03-04 15:29:45,660 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 60 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2025-03-04 15:29:45,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 454 flow [2025-03-04 15:29:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:29:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:29:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2025-03-04 15:29:45,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6353276353276354 [2025-03-04 15:29:45,661 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 334 flow. Second operand 3 states and 223 transitions. [2025-03-04 15:29:45,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 454 flow [2025-03-04 15:29:45,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 115 transitions, 444 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:45,679 INFO L231 Difference]: Finished difference. Result has 117 places, 115 transitions, 324 flow [2025-03-04 15:29:45,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=117, PETRI_TRANSITIONS=115} [2025-03-04 15:29:45,679 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 6 predicate places. [2025-03-04 15:29:45,679 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 115 transitions, 324 flow [2025-03-04 15:29:45,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:45,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:45,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:45,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:29:45,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2025-03-04 15:29:45,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:45,680 INFO L85 PathProgramCache]: Analyzing trace with hash -394950715, now seen corresponding path program 1 times [2025-03-04 15:29:45,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:45,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110898634] [2025-03-04 15:29:45,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:45,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:45,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:29:45,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:29:45,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:45,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:45,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:45,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110898634] [2025-03-04 15:29:45,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110898634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:45,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690479609] [2025-03-04 15:29:45,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:45,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:45,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:45,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:45,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:29:45,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:29:45,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:29:45,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:45,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:45,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:29:45,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:46,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:29:46,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 15:29:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:46,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:46,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-04 15:29:46,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-04 15:29:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:46,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690479609] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:46,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:46,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:29:46,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817071520] [2025-03-04 15:29:46,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:46,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:29:46,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:46,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:29:46,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:29:46,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 117 [2025-03-04 15:29:46,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 115 transitions, 324 flow. Second operand has 13 states, 13 states have (on average 55.38461538461539) internal successors, (720), 13 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:46,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:46,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 117 [2025-03-04 15:29:46,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:48,943 INFO L124 PetriNetUnfolderBase]: 23143/44468 cut-off events. [2025-03-04 15:29:48,943 INFO L125 PetriNetUnfolderBase]: For 6779/6791 co-relation queries the response was YES. [2025-03-04 15:29:49,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83801 conditions, 44468 events. 23143/44468 cut-off events. For 6779/6791 co-relation queries the response was YES. Maximal size of possible extension queue 1407. Compared 443564 event pairs, 6600 based on Foata normal form. 12/34325 useless extension candidates. Maximal degree in co-relation 83778. Up to 12228 conditions per place. [2025-03-04 15:29:49,163 INFO L140 encePairwiseOnDemand]: 104/117 looper letters, 176 selfloop transitions, 18 changer transitions 0/245 dead transitions. [2025-03-04 15:29:49,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 245 transitions, 1002 flow [2025-03-04 15:29:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 724 transitions. [2025-03-04 15:29:49,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6188034188034188 [2025-03-04 15:29:49,165 INFO L175 Difference]: Start difference. First operand has 117 places, 115 transitions, 324 flow. Second operand 10 states and 724 transitions. [2025-03-04 15:29:49,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 245 transitions, 1002 flow [2025-03-04 15:29:49,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 245 transitions, 998 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:29:49,277 INFO L231 Difference]: Finished difference. Result has 127 places, 124 transitions, 427 flow [2025-03-04 15:29:49,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=427, PETRI_PLACES=127, PETRI_TRANSITIONS=124} [2025-03-04 15:29:49,278 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 16 predicate places. [2025-03-04 15:29:49,278 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 124 transitions, 427 flow [2025-03-04 15:29:49,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 55.38461538461539) internal successors, (720), 13 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:49,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:49,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:49,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:29:49,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:49,479 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2025-03-04 15:29:49,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:49,479 INFO L85 PathProgramCache]: Analyzing trace with hash 641399836, now seen corresponding path program 1 times [2025-03-04 15:29:49,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:49,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081226905] [2025-03-04 15:29:49,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:49,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:49,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:49,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:49,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:49,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:49,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:49,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081226905] [2025-03-04 15:29:49,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081226905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:29:49,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495882381] [2025-03-04 15:29:49,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:49,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:49,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:29:49,663 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:29:49,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:29:49,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:49,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:49,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:49,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:49,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 15:29:49,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:29:49,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 15:29:49,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 15:29:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:49,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:29:49,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 15:29:49,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-04 15:29:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:29:49,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495882381] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:29:49,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:29:49,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:29:49,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895289323] [2025-03-04 15:29:49,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:29:49,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:29:49,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:49,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:29:49,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:29:49,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 117 [2025-03-04 15:29:49,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 124 transitions, 427 flow. Second operand has 13 states, 13 states have (on average 53.53846153846154) internal successors, (696), 13 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:49,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:49,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 117 [2025-03-04 15:29:49,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:54,013 INFO L124 PetriNetUnfolderBase]: 27767/49283 cut-off events. [2025-03-04 15:29:54,013 INFO L125 PetriNetUnfolderBase]: For 21540/21697 co-relation queries the response was YES. [2025-03-04 15:29:54,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101909 conditions, 49283 events. 27767/49283 cut-off events. For 21540/21697 co-relation queries the response was YES. Maximal size of possible extension queue 1623. Compared 457297 event pairs, 7715 based on Foata normal form. 423/38443 useless extension candidates. Maximal degree in co-relation 101873. Up to 15186 conditions per place. [2025-03-04 15:29:54,248 INFO L140 encePairwiseOnDemand]: 104/117 looper letters, 180 selfloop transitions, 18 changer transitions 0/246 dead transitions. [2025-03-04 15:29:54,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 246 transitions, 1083 flow [2025-03-04 15:29:54,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:29:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:29:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 704 transitions. [2025-03-04 15:29:54,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6017094017094017 [2025-03-04 15:29:54,250 INFO L175 Difference]: Start difference. First operand has 127 places, 124 transitions, 427 flow. Second operand 10 states and 704 transitions. [2025-03-04 15:29:54,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 246 transitions, 1083 flow [2025-03-04 15:29:54,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 246 transitions, 1071 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:29:54,294 INFO L231 Difference]: Finished difference. Result has 134 places, 126 transitions, 477 flow [2025-03-04 15:29:54,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=477, PETRI_PLACES=134, PETRI_TRANSITIONS=126} [2025-03-04 15:29:54,294 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 23 predicate places. [2025-03-04 15:29:54,295 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 126 transitions, 477 flow [2025-03-04 15:29:54,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 53.53846153846154) internal successors, (696), 13 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:54,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:54,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:54,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:29:54,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:29:54,496 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2025-03-04 15:29:54,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:54,496 INFO L85 PathProgramCache]: Analyzing trace with hash 294124128, now seen corresponding path program 1 times [2025-03-04 15:29:54,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:54,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057973723] [2025-03-04 15:29:54,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:54,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:54,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:29:54,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:29:54,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:54,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:29:54,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:54,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057973723] [2025-03-04 15:29:54,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057973723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:54,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:54,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515980379] [2025-03-04 15:29:54,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:54,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:54,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:54,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:54,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 117 [2025-03-04 15:29:54,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 126 transitions, 477 flow. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:54,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:54,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 117 [2025-03-04 15:29:54,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:29:59,125 INFO L124 PetriNetUnfolderBase]: 33435/61029 cut-off events. [2025-03-04 15:29:59,125 INFO L125 PetriNetUnfolderBase]: For 47569/48379 co-relation queries the response was YES. [2025-03-04 15:29:59,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133028 conditions, 61029 events. 33435/61029 cut-off events. For 47569/48379 co-relation queries the response was YES. Maximal size of possible extension queue 1870. Compared 609761 event pairs, 14798 based on Foata normal form. 1908/48036 useless extension candidates. Maximal degree in co-relation 132990. Up to 26465 conditions per place. [2025-03-04 15:29:59,489 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 148 selfloop transitions, 5 changer transitions 0/203 dead transitions. [2025-03-04 15:29:59,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 203 transitions, 1135 flow [2025-03-04 15:29:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:29:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:29:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2025-03-04 15:29:59,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6816239316239316 [2025-03-04 15:29:59,490 INFO L175 Difference]: Start difference. First operand has 134 places, 126 transitions, 477 flow. Second operand 4 states and 319 transitions. [2025-03-04 15:29:59,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 203 transitions, 1135 flow [2025-03-04 15:29:59,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 203 transitions, 1087 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-04 15:29:59,653 INFO L231 Difference]: Finished difference. Result has 132 places, 128 transitions, 487 flow [2025-03-04 15:29:59,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=487, PETRI_PLACES=132, PETRI_TRANSITIONS=128} [2025-03-04 15:29:59,654 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 21 predicate places. [2025-03-04 15:29:59,654 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 487 flow [2025-03-04 15:29:59,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:59,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:29:59,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:29:59,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:29:59,654 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2025-03-04 15:29:59,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:29:59,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1591440696, now seen corresponding path program 1 times [2025-03-04 15:29:59,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:29:59,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279784863] [2025-03-04 15:29:59,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:29:59,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:29:59,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:29:59,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:29:59,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:29:59,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:29:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:29:59,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:29:59,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279784863] [2025-03-04 15:29:59,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279784863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:29:59,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:29:59,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:29:59,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181433897] [2025-03-04 15:29:59,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:29:59,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:29:59,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:29:59,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:29:59,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:29:59,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 117 [2025-03-04 15:29:59,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 128 transitions, 487 flow. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:29:59,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:29:59,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 117 [2025-03-04 15:29:59,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:30:04,057 INFO L124 PetriNetUnfolderBase]: 30495/56173 cut-off events. [2025-03-04 15:30:04,057 INFO L125 PetriNetUnfolderBase]: For 39022/40448 co-relation queries the response was YES. [2025-03-04 15:30:04,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124961 conditions, 56173 events. 30495/56173 cut-off events. For 39022/40448 co-relation queries the response was YES. Maximal size of possible extension queue 1779. Compared 559385 event pairs, 14084 based on Foata normal form. 1350/45298 useless extension candidates. Maximal degree in co-relation 124925. Up to 24978 conditions per place. [2025-03-04 15:30:04,426 INFO L140 encePairwiseOnDemand]: 112/117 looper letters, 131 selfloop transitions, 8 changer transitions 0/187 dead transitions. [2025-03-04 15:30:04,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 187 transitions, 910 flow [2025-03-04 15:30:04,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:30:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:30:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2025-03-04 15:30:04,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2025-03-04 15:30:04,427 INFO L175 Difference]: Start difference. First operand has 132 places, 128 transitions, 487 flow. Second operand 4 states and 318 transitions. [2025-03-04 15:30:04,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 187 transitions, 910 flow [2025-03-04 15:30:04,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 187 transitions, 905 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:30:04,702 INFO L231 Difference]: Finished difference. Result has 134 places, 126 transitions, 481 flow [2025-03-04 15:30:04,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=481, PETRI_PLACES=134, PETRI_TRANSITIONS=126} [2025-03-04 15:30:04,702 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 23 predicate places. [2025-03-04 15:30:04,702 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 126 transitions, 481 flow [2025-03-04 15:30:04,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:04,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:30:04,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:30:04,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:30:04,703 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2025-03-04 15:30:04,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:30:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1591441689, now seen corresponding path program 1 times [2025-03-04 15:30:04,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:30:04,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783945075] [2025-03-04 15:30:04,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:30:04,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:30:04,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:30:04,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:30:04,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:30:04,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:30:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:30:04,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:30:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783945075] [2025-03-04 15:30:04,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783945075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:30:04,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:30:04,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:30:04,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100534204] [2025-03-04 15:30:04,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:30:04,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:30:04,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:30:04,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:30:04,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:30:04,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 117 [2025-03-04 15:30:04,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 126 transitions, 481 flow. Second operand has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:30:04,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:30:04,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 117 [2025-03-04 15:30:04,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand