./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-match-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-match-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:49:34,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:49:34,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:49:34,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:49:34,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:49:34,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:49:34,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:49:34,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:49:34,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:49:34,434 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:49:34,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:49:34,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:49:34,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:49:34,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:49:34,435 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:49:34,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:49:34,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:49:34,435 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:49:34,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:49:34,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:49:34,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:49:34,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:49:34,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:49:34,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:49:34,436 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:49:34,436 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:49:34,436 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:49:34,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:49:34,436 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:49:34,436 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:49:34,437 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:49:34,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:49:34,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:49:34,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:49:34,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:49:34,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:49:34,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:49:34,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:49:34,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:49:34,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:49:34,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:49:34,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:49:34,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:49:34,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:49:34,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:49:34,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:49:34,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:49:34,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:49:34,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:49:34,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:49:34,438 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f [2025-01-10 06:49:34,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:49:34,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:49:34,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:49:34,667 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:49:34,667 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:49:34,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-symm.wvr.c [2025-01-10 06:49:35,880 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73fdeeb34/ae145ba077c14438b73fff25956d5fdc/FLAG96cf84ba9 [2025-01-10 06:49:36,182 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:49:36,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c [2025-01-10 06:49:36,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73fdeeb34/ae145ba077c14438b73fff25956d5fdc/FLAG96cf84ba9 [2025-01-10 06:49:36,207 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73fdeeb34/ae145ba077c14438b73fff25956d5fdc [2025-01-10 06:49:36,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:49:36,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:49:36,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:49:36,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:49:36,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:49:36,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390e58be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36, skipping insertion in model container [2025-01-10 06:49:36,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:49:36,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:49:36,367 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:49:36,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:49:36,397 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:49:36,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36 WrapperNode [2025-01-10 06:49:36,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:49:36,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:49:36,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:49:36,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:49:36,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,429 INFO L138 Inliner]: procedures = 21, calls = 18, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 201 [2025-01-10 06:49:36,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:49:36,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:49:36,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:49:36,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:49:36,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,456 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 06:49:36,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,461 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:49:36,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:49:36,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:49:36,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:49:36,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36" (1/1) ... [2025-01-10 06:49:36,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:49:36,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:49:36,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:49:36,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:49:36,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:49:36,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:49:36,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:49:36,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:49:36,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:49:36,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:49:36,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:49:36,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:49:36,535 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:49:36,610 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:49:36,611 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:49:36,930 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:49:36,931 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:49:37,132 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:49:37,133 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:49:37,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:49:37 BoogieIcfgContainer [2025-01-10 06:49:37,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:49:37,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:49:37,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:49:37,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:49:37,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:49:36" (1/3) ... [2025-01-10 06:49:37,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e388a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:49:37, skipping insertion in model container [2025-01-10 06:49:37,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:49:36" (2/3) ... [2025-01-10 06:49:37,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e388a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:49:37, skipping insertion in model container [2025-01-10 06:49:37,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:49:37" (3/3) ... [2025-01-10 06:49:37,149 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-match-symm.wvr.c [2025-01-10 06:49:37,165 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:49:37,166 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-match-symm.wvr.c that has 3 procedures, 77 locations, 1 initial locations, 0 loop locations, and 24 error locations. [2025-01-10 06:49:37,166 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:49:37,234 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:49:37,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 84 transitions, 182 flow [2025-01-10 06:49:37,299 INFO L124 PetriNetUnfolderBase]: 8/82 cut-off events. [2025-01-10 06:49:37,302 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:49:37,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 82 events. 8/82 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 246 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2025-01-10 06:49:37,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 84 transitions, 182 flow [2025-01-10 06:49:37,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 80 transitions, 169 flow [2025-01-10 06:49:37,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:49:37,329 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;@66f15f6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:49:37,330 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-10 06:49:37,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:49:37,336 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-01-10 06:49:37,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:49:37,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:37,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:49:37,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:37,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:37,342 INFO L85 PathProgramCache]: Analyzing trace with hash 639002098, now seen corresponding path program 1 times [2025-01-10 06:49:37,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:37,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679890270] [2025-01-10 06:49:37,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:37,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:37,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:49:37,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:49:37,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:37,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:37,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:37,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679890270] [2025-01-10 06:49:37,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679890270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:37,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:37,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:49:37,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830768695] [2025-01-10 06:49:37,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:37,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:49:37,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:37,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:49:37,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:49:37,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 84 [2025-01-10 06:49:37,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 80 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:37,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:37,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 84 [2025-01-10 06:49:37,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:37,861 INFO L124 PetriNetUnfolderBase]: 728/1568 cut-off events. [2025-01-10 06:49:37,862 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-10 06:49:37,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 1568 events. 728/1568 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10615 event pairs, 256 based on Foata normal form. 52/1258 useless extension candidates. Maximal degree in co-relation 2669. Up to 573 conditions per place. [2025-01-10 06:49:37,872 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 43 selfloop transitions, 5 changer transitions 0/92 dead transitions. [2025-01-10 06:49:37,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 92 transitions, 292 flow [2025-01-10 06:49:37,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:49:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:49:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2025-01-10 06:49:37,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2025-01-10 06:49:37,883 INFO L175 Difference]: Start difference. First operand has 79 places, 80 transitions, 169 flow. Second operand 4 states and 234 transitions. [2025-01-10 06:49:37,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 92 transitions, 292 flow [2025-01-10 06:49:37,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 92 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:49:37,893 INFO L231 Difference]: Finished difference. Result has 77 places, 78 transitions, 170 flow [2025-01-10 06:49:37,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=77, PETRI_TRANSITIONS=78} [2025-01-10 06:49:37,898 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -2 predicate places. [2025-01-10 06:49:37,898 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 170 flow [2025-01-10 06:49:37,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:37,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:37,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:49:37,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:49:37,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:37,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:37,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1665770728, now seen corresponding path program 1 times [2025-01-10 06:49:37,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:37,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743313984] [2025-01-10 06:49:37,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:37,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:37,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:49:37,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:49:37,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:37,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:37,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:37,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:37,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743313984] [2025-01-10 06:49:37,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743313984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:37,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:37,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:49:37,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168748183] [2025-01-10 06:49:37,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:37,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:49:37,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:37,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:49:37,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:49:38,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 84 [2025-01-10 06:49:38,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:38,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:38,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 84 [2025-01-10 06:49:38,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:38,235 INFO L124 PetriNetUnfolderBase]: 648/1626 cut-off events. [2025-01-10 06:49:38,235 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-01-10 06:49:38,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 1626 events. 648/1626 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11628 event pairs, 213 based on Foata normal form. 0/1349 useless extension candidates. Maximal degree in co-relation 2089. Up to 549 conditions per place. [2025-01-10 06:49:38,244 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 40 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2025-01-10 06:49:38,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 93 transitions, 296 flow [2025-01-10 06:49:38,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:49:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:49:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2025-01-10 06:49:38,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-01-10 06:49:38,249 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 170 flow. Second operand 4 states and 240 transitions. [2025-01-10 06:49:38,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 93 transitions, 296 flow [2025-01-10 06:49:38,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:49:38,252 INFO L231 Difference]: Finished difference. Result has 77 places, 78 transitions, 182 flow [2025-01-10 06:49:38,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=77, PETRI_TRANSITIONS=78} [2025-01-10 06:49:38,253 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, -2 predicate places. [2025-01-10 06:49:38,253 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 182 flow [2025-01-10 06:49:38,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:38,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:38,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:38,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:49:38,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:38,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:38,254 INFO L85 PathProgramCache]: Analyzing trace with hash -170899942, now seen corresponding path program 1 times [2025-01-10 06:49:38,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:38,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010689822] [2025-01-10 06:49:38,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:38,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:38,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:49:38,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:49:38,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:38,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:38,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:38,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010689822] [2025-01-10 06:49:38,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010689822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:38,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:38,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:49:38,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546698807] [2025-01-10 06:49:38,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:38,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:49:38,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:38,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:49:38,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:49:38,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 84 [2025-01-10 06:49:38,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:38,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:38,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 84 [2025-01-10 06:49:38,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:38,689 INFO L124 PetriNetUnfolderBase]: 1307/2614 cut-off events. [2025-01-10 06:49:38,689 INFO L125 PetriNetUnfolderBase]: For 488/488 co-relation queries the response was YES. [2025-01-10 06:49:38,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5025 conditions, 2614 events. 1307/2614 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 18454 event pairs, 327 based on Foata normal form. 108/2259 useless extension candidates. Maximal degree in co-relation 1777. Up to 930 conditions per place. [2025-01-10 06:49:38,706 INFO L140 encePairwiseOnDemand]: 69/84 looper letters, 65 selfloop transitions, 10 changer transitions 0/112 dead transitions. [2025-01-10 06:49:38,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 112 transitions, 430 flow [2025-01-10 06:49:38,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:49:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:49:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2025-01-10 06:49:38,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2025-01-10 06:49:38,708 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 182 flow. Second operand 4 states and 246 transitions. [2025-01-10 06:49:38,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 112 transitions, 430 flow [2025-01-10 06:49:38,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 112 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:49:38,711 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 240 flow [2025-01-10 06:49:38,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2025-01-10 06:49:38,712 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 0 predicate places. [2025-01-10 06:49:38,712 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 240 flow [2025-01-10 06:49:38,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:38,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:38,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:38,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:49:38,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:38,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1216168698, now seen corresponding path program 1 times [2025-01-10 06:49:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:38,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261797187] [2025-01-10 06:49:38,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:38,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:38,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:49:38,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:49:38,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:38,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:38,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:38,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261797187] [2025-01-10 06:49:38,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261797187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:38,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:38,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:49:38,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138490906] [2025-01-10 06:49:38,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:38,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:49:38,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:38,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:49:38,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:49:38,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 84 [2025-01-10 06:49:38,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:38,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:38,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 84 [2025-01-10 06:49:38,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:39,301 INFO L124 PetriNetUnfolderBase]: 1703/3642 cut-off events. [2025-01-10 06:49:39,302 INFO L125 PetriNetUnfolderBase]: For 1412/1580 co-relation queries the response was YES. [2025-01-10 06:49:39,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7724 conditions, 3642 events. 1703/3642 cut-off events. For 1412/1580 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 27640 event pairs, 475 based on Foata normal form. 92/3364 useless extension candidates. Maximal degree in co-relation 6351. Up to 1296 conditions per place. [2025-01-10 06:49:39,322 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 73 selfloop transitions, 10 changer transitions 0/122 dead transitions. [2025-01-10 06:49:39,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 122 transitions, 560 flow [2025-01-10 06:49:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:49:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:49:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 292 transitions. [2025-01-10 06:49:39,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2025-01-10 06:49:39,323 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 240 flow. Second operand 5 states and 292 transitions. [2025-01-10 06:49:39,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 122 transitions, 560 flow [2025-01-10 06:49:39,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 122 transitions, 560 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:49:39,331 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 291 flow [2025-01-10 06:49:39,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2025-01-10 06:49:39,332 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 6 predicate places. [2025-01-10 06:49:39,332 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 291 flow [2025-01-10 06:49:39,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:39,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:39,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:39,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:49:39,332 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:39,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:39,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1216169723, now seen corresponding path program 1 times [2025-01-10 06:49:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:39,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099100963] [2025-01-10 06:49:39,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:39,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:39,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:49:39,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:49:39,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:39,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:39,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:39,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099100963] [2025-01-10 06:49:39,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099100963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:39,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:39,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:49:39,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333988727] [2025-01-10 06:49:39,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:39,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:49:39,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:39,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:49:39,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:49:39,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 84 [2025-01-10 06:49:39,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 291 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:39,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:39,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 84 [2025-01-10 06:49:39,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:39,737 INFO L124 PetriNetUnfolderBase]: 1735/4080 cut-off events. [2025-01-10 06:49:39,738 INFO L125 PetriNetUnfolderBase]: For 2604/2747 co-relation queries the response was YES. [2025-01-10 06:49:39,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9267 conditions, 4080 events. 1735/4080 cut-off events. For 2604/2747 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 33786 event pairs, 463 based on Foata normal form. 112/3795 useless extension candidates. Maximal degree in co-relation 8285. Up to 1228 conditions per place. [2025-01-10 06:49:39,761 INFO L140 encePairwiseOnDemand]: 71/84 looper letters, 74 selfloop transitions, 13 changer transitions 0/127 dead transitions. [2025-01-10 06:49:39,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 127 transitions, 639 flow [2025-01-10 06:49:39,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:49:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:49:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2025-01-10 06:49:39,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2025-01-10 06:49:39,763 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 291 flow. Second operand 4 states and 244 transitions. [2025-01-10 06:49:39,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 127 transitions, 639 flow [2025-01-10 06:49:39,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 127 transitions, 629 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:49:39,773 INFO L231 Difference]: Finished difference. Result has 88 places, 89 transitions, 363 flow [2025-01-10 06:49:39,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=363, PETRI_PLACES=88, PETRI_TRANSITIONS=89} [2025-01-10 06:49:39,773 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 9 predicate places. [2025-01-10 06:49:39,773 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 89 transitions, 363 flow [2025-01-10 06:49:39,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:39,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:39,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:39,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:49:39,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:39,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:39,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1002930155, now seen corresponding path program 1 times [2025-01-10 06:49:39,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:39,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644283642] [2025-01-10 06:49:39,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:39,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:39,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:49:39,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:49:39,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:39,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:39,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:39,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644283642] [2025-01-10 06:49:39,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644283642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:39,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:39,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:49:39,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998150466] [2025-01-10 06:49:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:39,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:49:39,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:39,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:49:39,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:49:39,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 84 [2025-01-10 06:49:39,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 363 flow. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:39,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:39,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 84 [2025-01-10 06:49:39,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:40,218 INFO L124 PetriNetUnfolderBase]: 1495/3792 cut-off events. [2025-01-10 06:49:40,218 INFO L125 PetriNetUnfolderBase]: For 4048/4242 co-relation queries the response was YES. [2025-01-10 06:49:40,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9030 conditions, 3792 events. 1495/3792 cut-off events. For 4048/4242 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 32453 event pairs, 500 based on Foata normal form. 107/3451 useless extension candidates. Maximal degree in co-relation 3357. Up to 1105 conditions per place. [2025-01-10 06:49:40,238 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 57 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2025-01-10 06:49:40,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 110 transitions, 618 flow [2025-01-10 06:49:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:49:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:49:40,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-01-10 06:49:40,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7113095238095238 [2025-01-10 06:49:40,240 INFO L175 Difference]: Start difference. First operand has 88 places, 89 transitions, 363 flow. Second operand 4 states and 239 transitions. [2025-01-10 06:49:40,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 110 transitions, 618 flow [2025-01-10 06:49:40,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 110 transitions, 605 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:49:40,249 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 379 flow [2025-01-10 06:49:40,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=379, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2025-01-10 06:49:40,250 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 11 predicate places. [2025-01-10 06:49:40,250 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 379 flow [2025-01-10 06:49:40,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:40,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:40,251 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:40,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:49:40,251 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:40,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:40,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1026094754, now seen corresponding path program 1 times [2025-01-10 06:49:40,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:40,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39548667] [2025-01-10 06:49:40,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:40,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:40,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:49:40,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:49:40,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:40,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:40,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:40,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39548667] [2025-01-10 06:49:40,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39548667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:40,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:40,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:49:40,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129833404] [2025-01-10 06:49:40,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:40,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:49:40,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:40,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:49:40,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:49:40,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 84 [2025-01-10 06:49:40,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 379 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:40,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:40,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 84 [2025-01-10 06:49:40,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:40,635 INFO L124 PetriNetUnfolderBase]: 1578/3866 cut-off events. [2025-01-10 06:49:40,635 INFO L125 PetriNetUnfolderBase]: For 5291/5485 co-relation queries the response was YES. [2025-01-10 06:49:40,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9650 conditions, 3866 events. 1578/3866 cut-off events. For 5291/5485 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 32692 event pairs, 612 based on Foata normal form. 148/3549 useless extension candidates. Maximal degree in co-relation 3427. Up to 1315 conditions per place. [2025-01-10 06:49:40,653 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 59 selfloop transitions, 7 changer transitions 0/108 dead transitions. [2025-01-10 06:49:40,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 108 transitions, 625 flow [2025-01-10 06:49:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:49:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:49:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 230 transitions. [2025-01-10 06:49:40,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6845238095238095 [2025-01-10 06:49:40,655 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 379 flow. Second operand 4 states and 230 transitions. [2025-01-10 06:49:40,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 108 transitions, 625 flow [2025-01-10 06:49:40,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 108 transitions, 617 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:49:40,665 INFO L231 Difference]: Finished difference. Result has 90 places, 88 transitions, 381 flow [2025-01-10 06:49:40,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=381, PETRI_PLACES=90, PETRI_TRANSITIONS=88} [2025-01-10 06:49:40,666 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 11 predicate places. [2025-01-10 06:49:40,666 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 88 transitions, 381 flow [2025-01-10 06:49:40,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:40,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:40,667 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:40,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:49:40,667 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:40,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:40,668 INFO L85 PathProgramCache]: Analyzing trace with hash -953475303, now seen corresponding path program 1 times [2025-01-10 06:49:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:40,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538167670] [2025-01-10 06:49:40,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:40,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:40,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:49:40,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:49:40,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:40,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:40,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:40,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538167670] [2025-01-10 06:49:40,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538167670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:40,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:40,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:49:40,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585693885] [2025-01-10 06:49:40,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:40,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:49:40,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:40,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:49:40,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:49:40,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 84 [2025-01-10 06:49:40,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 88 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:40,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:40,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 84 [2025-01-10 06:49:40,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:41,216 INFO L124 PetriNetUnfolderBase]: 2386/4746 cut-off events. [2025-01-10 06:49:41,217 INFO L125 PetriNetUnfolderBase]: For 6379/6583 co-relation queries the response was YES. [2025-01-10 06:49:41,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12761 conditions, 4746 events. 2386/4746 cut-off events. For 6379/6583 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 36465 event pairs, 681 based on Foata normal form. 263/4665 useless extension candidates. Maximal degree in co-relation 5173. Up to 1411 conditions per place. [2025-01-10 06:49:41,239 INFO L140 encePairwiseOnDemand]: 71/84 looper letters, 137 selfloop transitions, 13 changer transitions 0/185 dead transitions. [2025-01-10 06:49:41,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 185 transitions, 1157 flow [2025-01-10 06:49:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:49:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:49:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 419 transitions. [2025-01-10 06:49:41,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6235119047619048 [2025-01-10 06:49:41,241 INFO L175 Difference]: Start difference. First operand has 90 places, 88 transitions, 381 flow. Second operand 8 states and 419 transitions. [2025-01-10 06:49:41,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 185 transitions, 1157 flow [2025-01-10 06:49:41,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 185 transitions, 1113 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:49:41,255 INFO L231 Difference]: Finished difference. Result has 97 places, 90 transitions, 424 flow [2025-01-10 06:49:41,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=424, PETRI_PLACES=97, PETRI_TRANSITIONS=90} [2025-01-10 06:49:41,256 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 18 predicate places. [2025-01-10 06:49:41,256 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 90 transitions, 424 flow [2025-01-10 06:49:41,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:41,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:41,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:41,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:49:41,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:41,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:41,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1744166569, now seen corresponding path program 1 times [2025-01-10 06:49:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:41,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821854932] [2025-01-10 06:49:41,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:41,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:41,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:49:41,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:49:41,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:41,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:41,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:41,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821854932] [2025-01-10 06:49:41,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821854932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:41,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:41,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:49:41,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677660056] [2025-01-10 06:49:41,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:41,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:49:41,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:41,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:49:41,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:49:41,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 84 [2025-01-10 06:49:41,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 90 transitions, 424 flow. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:41,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:41,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 84 [2025-01-10 06:49:41,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:41,813 INFO L124 PetriNetUnfolderBase]: 2329/4465 cut-off events. [2025-01-10 06:49:41,813 INFO L125 PetriNetUnfolderBase]: For 10286/11003 co-relation queries the response was YES. [2025-01-10 06:49:41,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13466 conditions, 4465 events. 2329/4465 cut-off events. For 10286/11003 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 32847 event pairs, 558 based on Foata normal form. 418/4625 useless extension candidates. Maximal degree in co-relation 11599. Up to 1824 conditions per place. [2025-01-10 06:49:41,836 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 85 selfloop transitions, 12 changer transitions 0/135 dead transitions. [2025-01-10 06:49:41,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 135 transitions, 924 flow [2025-01-10 06:49:41,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:49:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:49:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2025-01-10 06:49:41,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6880952380952381 [2025-01-10 06:49:41,838 INFO L175 Difference]: Start difference. First operand has 97 places, 90 transitions, 424 flow. Second operand 5 states and 289 transitions. [2025-01-10 06:49:41,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 135 transitions, 924 flow [2025-01-10 06:49:41,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 135 transitions, 903 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:49:41,850 INFO L231 Difference]: Finished difference. Result has 99 places, 90 transitions, 461 flow [2025-01-10 06:49:41,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=461, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2025-01-10 06:49:41,850 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 20 predicate places. [2025-01-10 06:49:41,850 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 461 flow [2025-01-10 06:49:41,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:41,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:41,851 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:41,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:49:41,851 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:41,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:41,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1454354496, now seen corresponding path program 1 times [2025-01-10 06:49:41,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:41,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345587466] [2025-01-10 06:49:41,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:41,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:41,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:49:41,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:49:41,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:41,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:41,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345587466] [2025-01-10 06:49:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345587466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:41,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:41,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:49:41,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190136274] [2025-01-10 06:49:41,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:41,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:49:41,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:41,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:49:41,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:49:41,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 84 [2025-01-10 06:49:41,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:41,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:41,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 84 [2025-01-10 06:49:41,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:42,248 INFO L124 PetriNetUnfolderBase]: 1830/4024 cut-off events. [2025-01-10 06:49:42,249 INFO L125 PetriNetUnfolderBase]: For 8273/8393 co-relation queries the response was YES. [2025-01-10 06:49:42,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12141 conditions, 4024 events. 1830/4024 cut-off events. For 8273/8393 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 31586 event pairs, 634 based on Foata normal form. 186/4084 useless extension candidates. Maximal degree in co-relation 11028. Up to 1247 conditions per place. [2025-01-10 06:49:42,268 INFO L140 encePairwiseOnDemand]: 70/84 looper letters, 114 selfloop transitions, 16 changer transitions 0/164 dead transitions. [2025-01-10 06:49:42,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 164 transitions, 1165 flow [2025-01-10 06:49:42,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:49:42,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:49:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 335 transitions. [2025-01-10 06:49:42,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6646825396825397 [2025-01-10 06:49:42,270 INFO L175 Difference]: Start difference. First operand has 99 places, 90 transitions, 461 flow. Second operand 6 states and 335 transitions. [2025-01-10 06:49:42,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 164 transitions, 1165 flow [2025-01-10 06:49:42,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 164 transitions, 1121 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 06:49:42,286 INFO L231 Difference]: Finished difference. Result has 101 places, 88 transitions, 474 flow [2025-01-10 06:49:42,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=101, PETRI_TRANSITIONS=88} [2025-01-10 06:49:42,286 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 22 predicate places. [2025-01-10 06:49:42,287 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 88 transitions, 474 flow [2025-01-10 06:49:42,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:42,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:42,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:42,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:49:42,287 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:42,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1744165544, now seen corresponding path program 1 times [2025-01-10 06:49:42,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:42,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948085272] [2025-01-10 06:49:42,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:42,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:42,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:49:42,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:49:42,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:42,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948085272] [2025-01-10 06:49:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948085272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:49:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413853920] [2025-01-10 06:49:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:42,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:49:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:42,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:49:42,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:49:42,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 84 [2025-01-10 06:49:42,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 88 transitions, 474 flow. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 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-01-10 06:49:42,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:42,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 84 [2025-01-10 06:49:42,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:42,692 INFO L124 PetriNetUnfolderBase]: 1538/3401 cut-off events. [2025-01-10 06:49:42,693 INFO L125 PetriNetUnfolderBase]: For 10634/10925 co-relation queries the response was YES. [2025-01-10 06:49:42,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10944 conditions, 3401 events. 1538/3401 cut-off events. For 10634/10925 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 26460 event pairs, 498 based on Foata normal form. 300/3512 useless extension candidates. Maximal degree in co-relation 9850. Up to 1042 conditions per place. [2025-01-10 06:49:42,707 INFO L140 encePairwiseOnDemand]: 75/84 looper letters, 87 selfloop transitions, 9 changer transitions 0/132 dead transitions. [2025-01-10 06:49:42,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 132 transitions, 1000 flow [2025-01-10 06:49:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:49:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:49:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2025-01-10 06:49:42,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-01-10 06:49:42,708 INFO L175 Difference]: Start difference. First operand has 101 places, 88 transitions, 474 flow. Second operand 4 states and 238 transitions. [2025-01-10 06:49:42,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 132 transitions, 1000 flow [2025-01-10 06:49:42,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 132 transitions, 943 flow, removed 12 selfloop flow, removed 3 redundant places. [2025-01-10 06:49:42,721 INFO L231 Difference]: Finished difference. Result has 101 places, 86 transitions, 459 flow [2025-01-10 06:49:42,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=459, PETRI_PLACES=101, PETRI_TRANSITIONS=86} [2025-01-10 06:49:42,723 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 22 predicate places. [2025-01-10 06:49:42,723 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 86 transitions, 459 flow [2025-01-10 06:49:42,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 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-01-10 06:49:42,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:42,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:42,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:49:42,723 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:42,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:42,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1765411969, now seen corresponding path program 1 times [2025-01-10 06:49:42,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:42,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454406529] [2025-01-10 06:49:42,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:42,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:42,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:49:42,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:49:42,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:42,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:42,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:42,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454406529] [2025-01-10 06:49:42,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454406529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:42,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:42,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:49:42,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216107553] [2025-01-10 06:49:42,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:42,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:49:42,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:42,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:49:42,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:49:42,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 84 [2025-01-10 06:49:42,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 86 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:42,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:42,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 84 [2025-01-10 06:49:42,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:43,211 INFO L124 PetriNetUnfolderBase]: 2060/3846 cut-off events. [2025-01-10 06:49:43,211 INFO L125 PetriNetUnfolderBase]: For 12628/13050 co-relation queries the response was YES. [2025-01-10 06:49:43,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12924 conditions, 3846 events. 2060/3846 cut-off events. For 12628/13050 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 27124 event pairs, 648 based on Foata normal form. 432/4104 useless extension candidates. Maximal degree in co-relation 11707. Up to 1355 conditions per place. [2025-01-10 06:49:43,223 INFO L140 encePairwiseOnDemand]: 71/84 looper letters, 152 selfloop transitions, 13 changer transitions 0/198 dead transitions. [2025-01-10 06:49:43,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 198 transitions, 1560 flow [2025-01-10 06:49:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:49:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:49:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 413 transitions. [2025-01-10 06:49:43,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2025-01-10 06:49:43,225 INFO L175 Difference]: Start difference. First operand has 101 places, 86 transitions, 459 flow. Second operand 8 states and 413 transitions. [2025-01-10 06:49:43,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 198 transitions, 1560 flow [2025-01-10 06:49:43,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 198 transitions, 1553 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:49:43,235 INFO L231 Difference]: Finished difference. Result has 110 places, 88 transitions, 509 flow [2025-01-10 06:49:43,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=509, PETRI_PLACES=110, PETRI_TRANSITIONS=88} [2025-01-10 06:49:43,236 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 31 predicate places. [2025-01-10 06:49:43,237 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 509 flow [2025-01-10 06:49:43,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:43,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:43,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:43,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:49:43,238 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:43,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:43,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1931664096, now seen corresponding path program 1 times [2025-01-10 06:49:43,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:43,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182336201] [2025-01-10 06:49:43,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:43,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:43,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:49:43,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:49:43,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:43,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:43,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:43,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:43,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182336201] [2025-01-10 06:49:43,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182336201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:43,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:43,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:49:43,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676499638] [2025-01-10 06:49:43,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:43,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:49:43,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:43,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:49:43,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:49:43,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 84 [2025-01-10 06:49:43,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 509 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:43,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:43,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 84 [2025-01-10 06:49:43,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:43,491 INFO L124 PetriNetUnfolderBase]: 1250/2975 cut-off events. [2025-01-10 06:49:43,491 INFO L125 PetriNetUnfolderBase]: For 11214/11526 co-relation queries the response was YES. [2025-01-10 06:49:43,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10553 conditions, 2975 events. 1250/2975 cut-off events. For 11214/11526 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 23397 event pairs, 389 based on Foata normal form. 226/3172 useless extension candidates. Maximal degree in co-relation 9520. Up to 1117 conditions per place. [2025-01-10 06:49:43,504 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 60 selfloop transitions, 7 changer transitions 0/109 dead transitions. [2025-01-10 06:49:43,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 109 transitions, 807 flow [2025-01-10 06:49:43,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:49:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:49:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2025-01-10 06:49:43,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-01-10 06:49:43,506 INFO L175 Difference]: Start difference. First operand has 110 places, 88 transitions, 509 flow. Second operand 4 states and 238 transitions. [2025-01-10 06:49:43,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 109 transitions, 807 flow [2025-01-10 06:49:43,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 109 transitions, 788 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 06:49:43,523 INFO L231 Difference]: Finished difference. Result has 110 places, 88 transitions, 532 flow [2025-01-10 06:49:43,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=532, PETRI_PLACES=110, PETRI_TRANSITIONS=88} [2025-01-10 06:49:43,524 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 31 predicate places. [2025-01-10 06:49:43,524 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 532 flow [2025-01-10 06:49:43,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:43,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:43,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:43,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:49:43,525 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:43,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:43,525 INFO L85 PathProgramCache]: Analyzing trace with hash -159485955, now seen corresponding path program 1 times [2025-01-10 06:49:43,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:43,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618461543] [2025-01-10 06:49:43,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:43,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:43,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:49:43,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:49:43,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:43,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:43,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:43,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:43,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618461543] [2025-01-10 06:49:43,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618461543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:43,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:43,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:49:43,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924504371] [2025-01-10 06:49:43,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:43,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:49:43,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:43,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:49:43,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:49:43,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 84 [2025-01-10 06:49:43,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 532 flow. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:43,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:43,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 84 [2025-01-10 06:49:43,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:43,946 INFO L124 PetriNetUnfolderBase]: 1923/3611 cut-off events. [2025-01-10 06:49:43,946 INFO L125 PetriNetUnfolderBase]: For 16688/17041 co-relation queries the response was YES. [2025-01-10 06:49:43,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13824 conditions, 3611 events. 1923/3611 cut-off events. For 16688/17041 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 25189 event pairs, 634 based on Foata normal form. 358/3908 useless extension candidates. Maximal degree in co-relation 12637. Up to 1331 conditions per place. [2025-01-10 06:49:43,962 INFO L140 encePairwiseOnDemand]: 71/84 looper letters, 135 selfloop transitions, 16 changer transitions 0/182 dead transitions. [2025-01-10 06:49:43,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 182 transitions, 1582 flow [2025-01-10 06:49:43,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:49:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:49:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 330 transitions. [2025-01-10 06:49:43,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2025-01-10 06:49:43,964 INFO L175 Difference]: Start difference. First operand has 110 places, 88 transitions, 532 flow. Second operand 6 states and 330 transitions. [2025-01-10 06:49:43,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 182 transitions, 1582 flow [2025-01-10 06:49:43,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 182 transitions, 1540 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-10 06:49:43,985 INFO L231 Difference]: Finished difference. Result has 112 places, 90 transitions, 571 flow [2025-01-10 06:49:43,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=112, PETRI_TRANSITIONS=90} [2025-01-10 06:49:43,986 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 33 predicate places. [2025-01-10 06:49:43,986 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 90 transitions, 571 flow [2025-01-10 06:49:43,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:43,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:43,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:43,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:49:43,986 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:43,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:43,986 INFO L85 PathProgramCache]: Analyzing trace with hash -247986208, now seen corresponding path program 1 times [2025-01-10 06:49:43,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:43,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280681606] [2025-01-10 06:49:43,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:43,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:43,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:49:43,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:49:43,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:43,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:44,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:44,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280681606] [2025-01-10 06:49:44,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280681606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:44,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:44,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:49:44,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469520735] [2025-01-10 06:49:44,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:44,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:49:44,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:44,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:49:44,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:49:44,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 84 [2025-01-10 06:49:44,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 90 transitions, 571 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:44,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:44,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 84 [2025-01-10 06:49:44,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:44,365 INFO L124 PetriNetUnfolderBase]: 1191/2838 cut-off events. [2025-01-10 06:49:44,366 INFO L125 PetriNetUnfolderBase]: For 12859/13070 co-relation queries the response was YES. [2025-01-10 06:49:44,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10833 conditions, 2838 events. 1191/2838 cut-off events. For 12859/13070 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 22076 event pairs, 491 based on Foata normal form. 213/3006 useless extension candidates. Maximal degree in co-relation 9817. Up to 1025 conditions per place. [2025-01-10 06:49:44,391 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 63 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2025-01-10 06:49:44,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 112 transitions, 886 flow [2025-01-10 06:49:44,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:49:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:49:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 227 transitions. [2025-01-10 06:49:44,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6755952380952381 [2025-01-10 06:49:44,393 INFO L175 Difference]: Start difference. First operand has 112 places, 90 transitions, 571 flow. Second operand 4 states and 227 transitions. [2025-01-10 06:49:44,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 112 transitions, 886 flow [2025-01-10 06:49:44,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 112 transitions, 813 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-01-10 06:49:44,424 INFO L231 Difference]: Finished difference. Result has 108 places, 89 transitions, 540 flow [2025-01-10 06:49:44,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=540, PETRI_PLACES=108, PETRI_TRANSITIONS=89} [2025-01-10 06:49:44,428 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 29 predicate places. [2025-01-10 06:49:44,428 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 89 transitions, 540 flow [2025-01-10 06:49:44,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:44,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:44,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:44,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:49:44,428 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:44,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:44,429 INFO L85 PathProgramCache]: Analyzing trace with hash 902361858, now seen corresponding path program 1 times [2025-01-10 06:49:44,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:44,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696465780] [2025-01-10 06:49:44,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:44,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:44,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:49:44,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:49:44,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:44,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:44,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696465780] [2025-01-10 06:49:44,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696465780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:44,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:44,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:49:44,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531386546] [2025-01-10 06:49:44,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:44,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:49:44,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:44,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:49:44,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:49:44,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 84 [2025-01-10 06:49:44,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 89 transitions, 540 flow. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:44,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:44,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 84 [2025-01-10 06:49:44,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:44,823 INFO L124 PetriNetUnfolderBase]: 1899/3586 cut-off events. [2025-01-10 06:49:44,824 INFO L125 PetriNetUnfolderBase]: For 13043/13369 co-relation queries the response was YES. [2025-01-10 06:49:44,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13305 conditions, 3586 events. 1899/3586 cut-off events. For 13043/13369 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 24895 event pairs, 389 based on Foata normal form. 320/3885 useless extension candidates. Maximal degree in co-relation 12035. Up to 1615 conditions per place. [2025-01-10 06:49:44,839 INFO L140 encePairwiseOnDemand]: 75/84 looper letters, 90 selfloop transitions, 12 changer transitions 0/134 dead transitions. [2025-01-10 06:49:44,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 134 transitions, 1026 flow [2025-01-10 06:49:44,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:49:44,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:49:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 288 transitions. [2025-01-10 06:49:44,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2025-01-10 06:49:44,841 INFO L175 Difference]: Start difference. First operand has 108 places, 89 transitions, 540 flow. Second operand 5 states and 288 transitions. [2025-01-10 06:49:44,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 134 transitions, 1026 flow [2025-01-10 06:49:44,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 134 transitions, 982 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 06:49:44,862 INFO L231 Difference]: Finished difference. Result has 105 places, 88 transitions, 516 flow [2025-01-10 06:49:44,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=516, PETRI_PLACES=105, PETRI_TRANSITIONS=88} [2025-01-10 06:49:44,863 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 26 predicate places. [2025-01-10 06:49:44,863 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 88 transitions, 516 flow [2025-01-10 06:49:44,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:44,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:44,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:44,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:49:44,864 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:44,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:44,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1514185725, now seen corresponding path program 1 times [2025-01-10 06:49:44,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:44,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468907370] [2025-01-10 06:49:44,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:44,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:44,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:49:44,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:49:44,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:44,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:44,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:44,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468907370] [2025-01-10 06:49:44,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468907370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:44,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:44,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:49:44,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916466675] [2025-01-10 06:49:44,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:44,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:49:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:44,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:49:44,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:49:44,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 84 [2025-01-10 06:49:44,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 88 transitions, 516 flow. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:44,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:44,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 84 [2025-01-10 06:49:44,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:45,237 INFO L124 PetriNetUnfolderBase]: 1313/2965 cut-off events. [2025-01-10 06:49:45,238 INFO L125 PetriNetUnfolderBase]: For 11460/11691 co-relation queries the response was YES. [2025-01-10 06:49:45,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10665 conditions, 2965 events. 1313/2965 cut-off events. For 11460/11691 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 22685 event pairs, 422 based on Foata normal form. 209/3134 useless extension candidates. Maximal degree in co-relation 9817. Up to 1152 conditions per place. [2025-01-10 06:49:45,253 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 65 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2025-01-10 06:49:45,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 111 transitions, 846 flow [2025-01-10 06:49:45,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:49:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:49:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2025-01-10 06:49:45,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7053571428571429 [2025-01-10 06:49:45,254 INFO L175 Difference]: Start difference. First operand has 105 places, 88 transitions, 516 flow. Second operand 4 states and 237 transitions. [2025-01-10 06:49:45,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 111 transitions, 846 flow [2025-01-10 06:49:45,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 111 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:49:45,268 INFO L231 Difference]: Finished difference. Result has 106 places, 88 transitions, 539 flow [2025-01-10 06:49:45,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=539, PETRI_PLACES=106, PETRI_TRANSITIONS=88} [2025-01-10 06:49:45,269 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 27 predicate places. [2025-01-10 06:49:45,269 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 539 flow [2025-01-10 06:49:45,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:45,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:45,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:45,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:49:45,269 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:45,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2091552733, now seen corresponding path program 1 times [2025-01-10 06:49:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:45,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445998867] [2025-01-10 06:49:45,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:45,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:49:45,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:49:45,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:45,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:45,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:45,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445998867] [2025-01-10 06:49:45,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445998867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:45,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:45,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:49:45,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664412834] [2025-01-10 06:49:45,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:45,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:49:45,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:45,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:49:45,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:49:45,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 84 [2025-01-10 06:49:45,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 539 flow. Second operand has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:45,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:45,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 84 [2025-01-10 06:49:45,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:45,821 INFO L124 PetriNetUnfolderBase]: 1624/3248 cut-off events. [2025-01-10 06:49:45,821 INFO L125 PetriNetUnfolderBase]: For 13864/14123 co-relation queries the response was YES. [2025-01-10 06:49:45,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12366 conditions, 3248 events. 1624/3248 cut-off events. For 13864/14123 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 23213 event pairs, 520 based on Foata normal form. 281/3472 useless extension candidates. Maximal degree in co-relation 11595. Up to 1079 conditions per place. [2025-01-10 06:49:45,834 INFO L140 encePairwiseOnDemand]: 75/84 looper letters, 142 selfloop transitions, 14 changer transitions 18/207 dead transitions. [2025-01-10 06:49:45,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 207 transitions, 1783 flow [2025-01-10 06:49:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:49:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:49:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 410 transitions. [2025-01-10 06:49:45,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6101190476190477 [2025-01-10 06:49:45,835 INFO L175 Difference]: Start difference. First operand has 106 places, 88 transitions, 539 flow. Second operand 8 states and 410 transitions. [2025-01-10 06:49:45,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 207 transitions, 1783 flow [2025-01-10 06:49:45,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 207 transitions, 1744 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:49:45,849 INFO L231 Difference]: Finished difference. Result has 109 places, 84 transitions, 518 flow [2025-01-10 06:49:45,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=518, PETRI_PLACES=109, PETRI_TRANSITIONS=84} [2025-01-10 06:49:45,849 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 30 predicate places. [2025-01-10 06:49:45,849 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 84 transitions, 518 flow [2025-01-10 06:49:45,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:45,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:45,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:45,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:49:45,850 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:45,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:45,850 INFO L85 PathProgramCache]: Analyzing trace with hash -304913784, now seen corresponding path program 1 times [2025-01-10 06:49:45,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:45,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070738625] [2025-01-10 06:49:45,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:45,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:45,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:49:45,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:49:45,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:45,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:45,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:45,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070738625] [2025-01-10 06:49:45,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070738625] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:45,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:45,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:49:45,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360569968] [2025-01-10 06:49:45,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:45,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:49:45,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:45,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:49:45,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:49:45,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 84 [2025-01-10 06:49:45,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 84 transitions, 518 flow. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:45,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:45,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 84 [2025-01-10 06:49:45,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:46,117 INFO L124 PetriNetUnfolderBase]: 1117/2675 cut-off events. [2025-01-10 06:49:46,117 INFO L125 PetriNetUnfolderBase]: For 11297/11480 co-relation queries the response was YES. [2025-01-10 06:49:46,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9738 conditions, 2675 events. 1117/2675 cut-off events. For 11297/11480 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 20852 event pairs, 475 based on Foata normal form. 204/2839 useless extension candidates. Maximal degree in co-relation 8866. Up to 925 conditions per place. [2025-01-10 06:49:46,130 INFO L140 encePairwiseOnDemand]: 81/84 looper letters, 64 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2025-01-10 06:49:46,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 106 transitions, 835 flow [2025-01-10 06:49:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:49:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:49:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2025-01-10 06:49:46,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2025-01-10 06:49:46,131 INFO L175 Difference]: Start difference. First operand has 109 places, 84 transitions, 518 flow. Second operand 4 states and 225 transitions. [2025-01-10 06:49:46,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 106 transitions, 835 flow [2025-01-10 06:49:46,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 106 transitions, 758 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-01-10 06:49:46,144 INFO L231 Difference]: Finished difference. Result has 101 places, 83 transitions, 474 flow [2025-01-10 06:49:46,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=474, PETRI_PLACES=101, PETRI_TRANSITIONS=83} [2025-01-10 06:49:46,145 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 22 predicate places. [2025-01-10 06:49:46,145 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 83 transitions, 474 flow [2025-01-10 06:49:46,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:46,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:46,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:46,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:49:46,145 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:46,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:46,146 INFO L85 PathProgramCache]: Analyzing trace with hash -862392961, now seen corresponding path program 1 times [2025-01-10 06:49:46,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:46,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730887327] [2025-01-10 06:49:46,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:46,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:46,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:49:46,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:49:46,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:46,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:46,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:46,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730887327] [2025-01-10 06:49:46,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730887327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:46,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:46,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:49:46,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161655996] [2025-01-10 06:49:46,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:46,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:49:46,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:46,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:49:46,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:49:46,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 84 [2025-01-10 06:49:46,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 83 transitions, 474 flow. Second operand has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:46,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:46,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 84 [2025-01-10 06:49:46,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:46,499 INFO L124 PetriNetUnfolderBase]: 1849/3394 cut-off events. [2025-01-10 06:49:46,499 INFO L125 PetriNetUnfolderBase]: For 11160/11439 co-relation queries the response was YES. [2025-01-10 06:49:46,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12109 conditions, 3394 events. 1849/3394 cut-off events. For 11160/11439 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 22969 event pairs, 369 based on Foata normal form. 315/3684 useless extension candidates. Maximal degree in co-relation 10733. Up to 1666 conditions per place. [2025-01-10 06:49:46,515 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 89 selfloop transitions, 9 changer transitions 2/128 dead transitions. [2025-01-10 06:49:46,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 128 transitions, 974 flow [2025-01-10 06:49:46,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:49:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:49:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 285 transitions. [2025-01-10 06:49:46,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-01-10 06:49:46,517 INFO L175 Difference]: Start difference. First operand has 101 places, 83 transitions, 474 flow. Second operand 5 states and 285 transitions. [2025-01-10 06:49:46,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 128 transitions, 974 flow [2025-01-10 06:49:46,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 128 transitions, 950 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:49:46,532 INFO L231 Difference]: Finished difference. Result has 100 places, 80 transitions, 454 flow [2025-01-10 06:49:46,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=454, PETRI_PLACES=100, PETRI_TRANSITIONS=80} [2025-01-10 06:49:46,533 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 21 predicate places. [2025-01-10 06:49:46,533 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 80 transitions, 454 flow [2025-01-10 06:49:46,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:46,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:49:46,533 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:46,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:49:46,533 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 06:49:46,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:49:46,534 INFO L85 PathProgramCache]: Analyzing trace with hash -964377237, now seen corresponding path program 1 times [2025-01-10 06:49:46,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:49:46,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389324041] [2025-01-10 06:49:46,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:49:46,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:49:46,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:49:46,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:49:46,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:49:46,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:49:46,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:49:46,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:49:46,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389324041] [2025-01-10 06:49:46,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389324041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:49:46,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:49:46,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:49:46,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130403595] [2025-01-10 06:49:46,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:49:46,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:49:46,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:49:46,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:49:46,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:49:46,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 84 [2025-01-10 06:49:46,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 80 transitions, 454 flow. Second operand has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:46,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:49:46,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 84 [2025-01-10 06:49:46,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:49:47,029 INFO L124 PetriNetUnfolderBase]: 1361/2709 cut-off events. [2025-01-10 06:49:47,030 INFO L125 PetriNetUnfolderBase]: For 8457/8660 co-relation queries the response was YES. [2025-01-10 06:49:47,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9806 conditions, 2709 events. 1361/2709 cut-off events. For 8457/8660 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 18833 event pairs, 475 based on Foata normal form. 255/2937 useless extension candidates. Maximal degree in co-relation 9787. Up to 925 conditions per place. [2025-01-10 06:49:47,038 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 0 selfloop transitions, 0 changer transitions 194/194 dead transitions. [2025-01-10 06:49:47,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 194 transitions, 1558 flow [2025-01-10 06:49:47,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:49:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:49:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2025-01-10 06:49:47,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5982142857142857 [2025-01-10 06:49:47,039 INFO L175 Difference]: Start difference. First operand has 100 places, 80 transitions, 454 flow. Second operand 8 states and 402 transitions. [2025-01-10 06:49:47,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 194 transitions, 1558 flow [2025-01-10 06:49:47,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 194 transitions, 1550 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:49:47,051 INFO L231 Difference]: Finished difference. Result has 103 places, 0 transitions, 0 flow [2025-01-10 06:49:47,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=103, PETRI_TRANSITIONS=0} [2025-01-10 06:49:47,051 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 24 predicate places. [2025-01-10 06:49:47,052 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 0 transitions, 0 flow [2025-01-10 06:49:47,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:49:47,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 50 remaining) [2025-01-10 06:49:47,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 50 remaining) [2025-01-10 06:49:47,056 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 50 remaining) [2025-01-10 06:49:47,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:49:47,057 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:49:47,060 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:49:47,060 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:49:47,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:49:47 BasicIcfg [2025-01-10 06:49:47,063 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:49:47,064 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:49:47,064 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:49:47,064 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:49:47,064 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:49:37" (3/4) ... [2025-01-10 06:49:47,065 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:49:47,067 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-10 06:49:47,067 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-10 06:49:47,069 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 76 nodes and edges [2025-01-10 06:49:47,070 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-10 06:49:47,070 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 06:49:47,070 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 06:49:47,126 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:49:47,127 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:49:47,127 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:49:47,127 INFO L158 Benchmark]: Toolchain (without parser) took 10914.76ms. Allocated memory was 201.3MB in the beginning and 755.0MB in the end (delta: 553.6MB). Free memory was 159.6MB in the beginning and 275.1MB in the end (delta: -115.5MB). Peak memory consumption was 436.5MB. Max. memory is 16.1GB. [2025-01-10 06:49:47,128 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 218.1MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:49:47,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.10ms. Allocated memory is still 201.3MB. Free memory was 159.6MB in the beginning and 148.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:49:47,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.28ms. Allocated memory is still 201.3MB. Free memory was 148.1MB in the beginning and 146.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:49:47,128 INFO L158 Benchmark]: Boogie Preprocessor took 40.05ms. Allocated memory is still 201.3MB. Free memory was 146.1MB in the beginning and 144.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:49:47,129 INFO L158 Benchmark]: RCFGBuilder took 661.48ms. Allocated memory is still 201.3MB. Free memory was 144.0MB in the beginning and 90.3MB in the end (delta: 53.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-10 06:49:47,129 INFO L158 Benchmark]: TraceAbstraction took 9926.90ms. Allocated memory was 201.3MB in the beginning and 755.0MB in the end (delta: 553.6MB). Free memory was 89.7MB in the beginning and 279.5MB in the end (delta: -189.8MB). Peak memory consumption was 361.0MB. Max. memory is 16.1GB. [2025-01-10 06:49:47,129 INFO L158 Benchmark]: Witness Printer took 63.03ms. Allocated memory is still 755.0MB. Free memory was 279.5MB in the beginning and 275.1MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:49:47,130 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 218.1MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.10ms. Allocated memory is still 201.3MB. Free memory was 159.6MB in the beginning and 148.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.28ms. Allocated memory is still 201.3MB. Free memory was 148.1MB in the beginning and 146.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.05ms. Allocated memory is still 201.3MB. Free memory was 146.1MB in the beginning and 144.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 661.48ms. Allocated memory is still 201.3MB. Free memory was 144.0MB in the beginning and 90.3MB in the end (delta: 53.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9926.90ms. Allocated memory was 201.3MB in the beginning and 755.0MB in the end (delta: 553.6MB). Free memory was 89.7MB in the beginning and 279.5MB in the end (delta: -189.8MB). Peak memory consumption was 361.0MB. Max. memory is 16.1GB. * Witness Printer took 63.03ms. Allocated memory is still 755.0MB. Free memory was 279.5MB in the beginning and 275.1MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 147 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.8s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2547 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1951 mSDsluCounter, 467 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 288 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3917 IncrementalHoareTripleChecker+Invalid, 4191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 179 mSDtfsCounter, 3917 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=571occurred in iteration=14, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:49:47,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE