./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-races/race-2_4-container_of.i --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/ldv-races/race-2_4-container_of.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:40:19,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:40:19,717 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:40:19,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:40:19,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:40:19,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:40:19,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:40:19,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:40:19,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:40:19,757 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:40:19,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:40:19,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:40:19,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:40:19,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:40:19,759 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:40:19,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:40:19,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:40:19,760 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:40:19,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:40:19,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:40:19,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:40:19,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:40:19,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:40:19,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:40:19,761 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:40:19,761 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:40:19,761 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:40:19,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:40:19,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:40:19,761 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:40:19,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:40:19,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:40:19,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:40:19,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:40:19,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:40:19,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:40:19,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:40:19,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:40:19,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:40:19,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:40:19,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:40:19,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:40:19,763 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:40:19,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:40:19,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:40:19,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:40:19,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:40:19,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:40:19,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:40:19,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:40:19,764 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 -> 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 [2025-01-10 06:40:20,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:40:20,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:40:20,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:40:20,092 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:40:20,093 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:40:20,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2025-01-10 06:40:21,478 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c74cfcba/01e2517b5e5b42b98d9d71fd5ce5d7ff/FLAG2625ae449 [2025-01-10 06:40:21,861 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:40:21,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2025-01-10 06:40:21,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c74cfcba/01e2517b5e5b42b98d9d71fd5ce5d7ff/FLAG2625ae449 [2025-01-10 06:40:22,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c74cfcba/01e2517b5e5b42b98d9d71fd5ce5d7ff [2025-01-10 06:40:22,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:40:22,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:40:22,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:40:22,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:40:22,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:40:22,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:22,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f678104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22, skipping insertion in model container [2025-01-10 06:40:22,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:22,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:40:22,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:40:22,644 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:40:22,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:40:22,764 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:40:22,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22 WrapperNode [2025-01-10 06:40:22,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:40:22,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:40:22,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:40:22,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:40:22,778 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:40:22" (1/1) ... [2025-01-10 06:40:22,795 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:40:22" (1/1) ... [2025-01-10 06:40:22,818 INFO L138 Inliner]: procedures = 248, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 154 [2025-01-10 06:40:22,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:40:22,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:40:22,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:40:22,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:40:22,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:22,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:22,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:22,845 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 15, 2]. 79 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 10 writes are split as follows [0, 8, 2]. [2025-01-10 06:40:22,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:22,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:22,862 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:22,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:22,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:22,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:22,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:22,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:40:22,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:40:22,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:40:22,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:40:22,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22" (1/1) ... [2025-01-10 06:40:22,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:40:22,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:40:22,919 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:40:22,927 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:40:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-01-10 06:40:22,948 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-01-10 06:40:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:40:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:40:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:40:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:40:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:40:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:40:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:40:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:40:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:40:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:40:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:40:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:40:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:40:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:40:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:40:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:40:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:40:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:40:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:40:22,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:40:22,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:40:22,953 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:40:23,231 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:40:23,233 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:40:23,524 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:40:23,524 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:40:23,728 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:40:23,728 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:40:23,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:40:23 BoogieIcfgContainer [2025-01-10 06:40:23,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:40:23,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:40:23,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:40:23,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:40:23,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:40:22" (1/3) ... [2025-01-10 06:40:23,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7374a7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:40:23, skipping insertion in model container [2025-01-10 06:40:23,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:22" (2/3) ... [2025-01-10 06:40:23,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7374a7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:40:23, skipping insertion in model container [2025-01-10 06:40:23,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:40:23" (3/3) ... [2025-01-10 06:40:23,738 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2025-01-10 06:40:23,754 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:40:23,755 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_4-container_of.i that has 2 procedures, 31 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-10 06:40:23,755 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:40:23,809 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:40:23,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 44 transitions, 102 flow [2025-01-10 06:40:23,875 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2025-01-10 06:40:23,879 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:40:23,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 51 events. 2/51 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 120 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 28. Up to 3 conditions per place. [2025-01-10 06:40:23,883 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 44 transitions, 102 flow [2025-01-10 06:40:23,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 38 transitions, 85 flow [2025-01-10 06:40:23,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:40:23,913 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;@2cc9b60d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:40:23,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 06:40:23,922 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:40:23,923 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-01-10 06:40:23,923 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:40:23,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:23,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:23,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:23,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:23,929 INFO L85 PathProgramCache]: Analyzing trace with hash -85911709, now seen corresponding path program 1 times [2025-01-10 06:40:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:23,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491093834] [2025-01-10 06:40:23,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:23,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:24,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:40:24,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:40:24,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:24,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:24,929 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:40:24,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:24,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491093834] [2025-01-10 06:40:24,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491093834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:24,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:24,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:40:24,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726386277] [2025-01-10 06:40:24,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:24,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:40:24,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:24,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:40:24,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:40:24,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:24,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 85 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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:40:24,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:24,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:24,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:25,822 INFO L124 PetriNetUnfolderBase]: 2221/3630 cut-off events. [2025-01-10 06:40:25,823 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-10 06:40:25,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7280 conditions, 3630 events. 2221/3630 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 20052 event pairs, 1170 based on Foata normal form. 0/3166 useless extension candidates. Maximal degree in co-relation 7188. Up to 2402 conditions per place. [2025-01-10 06:40:25,847 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 85 selfloop transitions, 24 changer transitions 3/115 dead transitions. [2025-01-10 06:40:25,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 115 transitions, 478 flow [2025-01-10 06:40:25,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:40:25,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:40:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2025-01-10 06:40:25,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-01-10 06:40:25,865 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 85 flow. Second operand 10 states and 176 transitions. [2025-01-10 06:40:25,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 115 transitions, 478 flow [2025-01-10 06:40:25,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 115 transitions, 467 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:40:25,879 INFO L231 Difference]: Finished difference. Result has 56 places, 63 transitions, 233 flow [2025-01-10 06:40:25,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=233, PETRI_PLACES=56, PETRI_TRANSITIONS=63} [2025-01-10 06:40:25,884 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2025-01-10 06:40:25,886 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 63 transitions, 233 flow [2025-01-10 06:40:25,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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:40:25,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:25,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:25,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:40:25,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:25,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:25,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1647241241, now seen corresponding path program 1 times [2025-01-10 06:40:25,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:25,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933944675] [2025-01-10 06:40:25,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:25,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:25,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:25,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:40:25,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:25,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:26,358 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:40:26,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:26,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933944675] [2025-01-10 06:40:26,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933944675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:26,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:26,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:40:26,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429658725] [2025-01-10 06:40:26,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:26,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:40:26,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:26,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:40:26,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:40:26,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:26,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 63 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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:40:26,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:26,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:26,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:27,154 INFO L124 PetriNetUnfolderBase]: 2697/4445 cut-off events. [2025-01-10 06:40:27,154 INFO L125 PetriNetUnfolderBase]: For 1572/1574 co-relation queries the response was YES. [2025-01-10 06:40:27,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10778 conditions, 4445 events. 2697/4445 cut-off events. For 1572/1574 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 26189 event pairs, 1670 based on Foata normal form. 2/4055 useless extension candidates. Maximal degree in co-relation 9198. Up to 3258 conditions per place. [2025-01-10 06:40:27,182 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 90 selfloop transitions, 33 changer transitions 5/131 dead transitions. [2025-01-10 06:40:27,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 131 transitions, 711 flow [2025-01-10 06:40:27,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:40:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:40:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2025-01-10 06:40:27,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3931818181818182 [2025-01-10 06:40:27,188 INFO L175 Difference]: Start difference. First operand has 56 places, 63 transitions, 233 flow. Second operand 10 states and 173 transitions. [2025-01-10 06:40:27,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 131 transitions, 711 flow [2025-01-10 06:40:27,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 131 transitions, 709 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:40:27,200 INFO L231 Difference]: Finished difference. Result has 68 places, 83 transitions, 424 flow [2025-01-10 06:40:27,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=424, PETRI_PLACES=68, PETRI_TRANSITIONS=83} [2025-01-10 06:40:27,201 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2025-01-10 06:40:27,201 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 83 transitions, 424 flow [2025-01-10 06:40:27,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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:40:27,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:27,202 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:40:27,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:40:27,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:27,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:27,203 INFO L85 PathProgramCache]: Analyzing trace with hash 575639303, now seen corresponding path program 1 times [2025-01-10 06:40:27,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:27,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289360919] [2025-01-10 06:40:27,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:27,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:27,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:27,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:27,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:27,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:28,142 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:40:28,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:28,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289360919] [2025-01-10 06:40:28,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289360919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:28,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:28,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:28,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307013418] [2025-01-10 06:40:28,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:28,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:28,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:28,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:28,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:28,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:28,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 83 transitions, 424 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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:40:28,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:28,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:28,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:29,640 INFO L124 PetriNetUnfolderBase]: 4137/6837 cut-off events. [2025-01-10 06:40:29,640 INFO L125 PetriNetUnfolderBase]: For 5357/5367 co-relation queries the response was YES. [2025-01-10 06:40:29,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18947 conditions, 6837 events. 4137/6837 cut-off events. For 5357/5367 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 43708 event pairs, 2277 based on Foata normal form. 120/6613 useless extension candidates. Maximal degree in co-relation 14692. Up to 4191 conditions per place. [2025-01-10 06:40:29,680 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 160 selfloop transitions, 81 changer transitions 5/249 dead transitions. [2025-01-10 06:40:29,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 249 transitions, 1700 flow [2025-01-10 06:40:29,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:40:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:40:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 272 transitions. [2025-01-10 06:40:29,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2025-01-10 06:40:29,685 INFO L175 Difference]: Start difference. First operand has 68 places, 83 transitions, 424 flow. Second operand 17 states and 272 transitions. [2025-01-10 06:40:29,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 249 transitions, 1700 flow [2025-01-10 06:40:29,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 249 transitions, 1700 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:40:29,715 INFO L231 Difference]: Finished difference. Result has 96 places, 157 transitions, 1223 flow [2025-01-10 06:40:29,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1223, PETRI_PLACES=96, PETRI_TRANSITIONS=157} [2025-01-10 06:40:29,717 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2025-01-10 06:40:29,718 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 157 transitions, 1223 flow [2025-01-10 06:40:29,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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:40:29,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:29,718 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:40:29,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:40:29,719 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:29,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:29,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2116807127, now seen corresponding path program 2 times [2025-01-10 06:40:29,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:29,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106373246] [2025-01-10 06:40:29,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:29,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:29,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:29,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:29,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:29,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:30,262 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:40:30,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:30,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106373246] [2025-01-10 06:40:30,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106373246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:30,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:30,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:30,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592523097] [2025-01-10 06:40:30,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:30,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:30,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:30,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:30,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:30,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:30,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 157 transitions, 1223 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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:40:30,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:30,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:30,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:32,063 INFO L124 PetriNetUnfolderBase]: 4430/7333 cut-off events. [2025-01-10 06:40:32,064 INFO L125 PetriNetUnfolderBase]: For 17252/17267 co-relation queries the response was YES. [2025-01-10 06:40:32,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25112 conditions, 7333 events. 4430/7333 cut-off events. For 17252/17267 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 47286 event pairs, 2098 based on Foata normal form. 125/7062 useless extension candidates. Maximal degree in co-relation 23985. Up to 3811 conditions per place. [2025-01-10 06:40:32,217 INFO L140 encePairwiseOnDemand]: 29/44 looper letters, 156 selfloop transitions, 145 changer transitions 4/308 dead transitions. [2025-01-10 06:40:32,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 308 transitions, 2720 flow [2025-01-10 06:40:32,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:40:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:40:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 323 transitions. [2025-01-10 06:40:32,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33367768595041325 [2025-01-10 06:40:32,221 INFO L175 Difference]: Start difference. First operand has 96 places, 157 transitions, 1223 flow. Second operand 22 states and 323 transitions. [2025-01-10 06:40:32,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 308 transitions, 2720 flow [2025-01-10 06:40:32,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 308 transitions, 2624 flow, removed 40 selfloop flow, removed 3 redundant places. [2025-01-10 06:40:32,291 INFO L231 Difference]: Finished difference. Result has 122 places, 219 transitions, 2166 flow [2025-01-10 06:40:32,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2166, PETRI_PLACES=122, PETRI_TRANSITIONS=219} [2025-01-10 06:40:32,294 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 77 predicate places. [2025-01-10 06:40:32,294 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 219 transitions, 2166 flow [2025-01-10 06:40:32,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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:40:32,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:32,295 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:40:32,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:40:32,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:32,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:32,296 INFO L85 PathProgramCache]: Analyzing trace with hash 288751653, now seen corresponding path program 1 times [2025-01-10 06:40:32,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:32,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134850418] [2025-01-10 06:40:32,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:32,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:32,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:32,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:32,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:32,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:32,852 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:40:32,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:32,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134850418] [2025-01-10 06:40:32,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134850418] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:32,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:32,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:32,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509609900] [2025-01-10 06:40:32,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:32,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:32,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:32,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:32,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:32,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:32,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 219 transitions, 2166 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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:40:32,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:32,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:32,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:34,434 INFO L124 PetriNetUnfolderBase]: 5214/8735 cut-off events. [2025-01-10 06:40:34,435 INFO L125 PetriNetUnfolderBase]: For 31154/31166 co-relation queries the response was YES. [2025-01-10 06:40:34,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33621 conditions, 8735 events. 5214/8735 cut-off events. For 31154/31166 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 59438 event pairs, 3117 based on Foata normal form. 142/8421 useless extension candidates. Maximal degree in co-relation 32472. Up to 6695 conditions per place. [2025-01-10 06:40:34,490 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 200 selfloop transitions, 78 changer transitions 17/298 dead transitions. [2025-01-10 06:40:34,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 298 transitions, 3259 flow [2025-01-10 06:40:34,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:40:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:40:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 204 transitions. [2025-01-10 06:40:34,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2025-01-10 06:40:34,493 INFO L175 Difference]: Start difference. First operand has 122 places, 219 transitions, 2166 flow. Second operand 12 states and 204 transitions. [2025-01-10 06:40:34,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 298 transitions, 3259 flow [2025-01-10 06:40:34,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 298 transitions, 3121 flow, removed 34 selfloop flow, removed 7 redundant places. [2025-01-10 06:40:34,618 INFO L231 Difference]: Finished difference. Result has 131 places, 230 transitions, 2394 flow [2025-01-10 06:40:34,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2043, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2394, PETRI_PLACES=131, PETRI_TRANSITIONS=230} [2025-01-10 06:40:34,619 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 86 predicate places. [2025-01-10 06:40:34,619 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 230 transitions, 2394 flow [2025-01-10 06:40:34,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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:40:34,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:34,620 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:40:34,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:40:34,620 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:34,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:34,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1209049952, now seen corresponding path program 1 times [2025-01-10 06:40:34,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:34,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879533762] [2025-01-10 06:40:34,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:34,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:34,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:34,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:34,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:34,697 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:40:34,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:34,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879533762] [2025-01-10 06:40:34,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879533762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:34,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:34,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:40:34,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306431572] [2025-01-10 06:40:34,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:34,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:40:34,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:34,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:40:34,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:40:34,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2025-01-10 06:40:34,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 230 transitions, 2394 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:40:34,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:34,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2025-01-10 06:40:34,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:35,542 INFO L124 PetriNetUnfolderBase]: 4024/6723 cut-off events. [2025-01-10 06:40:35,542 INFO L125 PetriNetUnfolderBase]: For 23259/23261 co-relation queries the response was YES. [2025-01-10 06:40:35,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26427 conditions, 6723 events. 4024/6723 cut-off events. For 23259/23261 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 43078 event pairs, 2059 based on Foata normal form. 0/6363 useless extension candidates. Maximal degree in co-relation 25541. Up to 5480 conditions per place. [2025-01-10 06:40:35,581 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 255 selfloop transitions, 21 changer transitions 0/278 dead transitions. [2025-01-10 06:40:35,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 278 transitions, 3315 flow [2025-01-10 06:40:35,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:40:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:40:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-01-10 06:40:35,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-01-10 06:40:35,583 INFO L175 Difference]: Start difference. First operand has 131 places, 230 transitions, 2394 flow. Second operand 4 states and 90 transitions. [2025-01-10 06:40:35,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 278 transitions, 3315 flow [2025-01-10 06:40:35,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 278 transitions, 3208 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-01-10 06:40:35,683 INFO L231 Difference]: Finished difference. Result has 126 places, 191 transitions, 1913 flow [2025-01-10 06:40:35,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1913, PETRI_PLACES=126, PETRI_TRANSITIONS=191} [2025-01-10 06:40:35,685 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 81 predicate places. [2025-01-10 06:40:35,685 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 191 transitions, 1913 flow [2025-01-10 06:40:35,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:40:35,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:35,685 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:40:35,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:40:35,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:35,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:35,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1205533971, now seen corresponding path program 1 times [2025-01-10 06:40:35,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:35,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813096274] [2025-01-10 06:40:35,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:35,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:35,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:35,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:35,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:35,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:36,254 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:40:36,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:36,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813096274] [2025-01-10 06:40:36,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813096274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:36,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:36,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:36,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758966902] [2025-01-10 06:40:36,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:36,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:36,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:36,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:36,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:36,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:36,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 191 transitions, 1913 flow. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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:40:36,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:36,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:36,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:37,592 INFO L124 PetriNetUnfolderBase]: 4330/7247 cut-off events. [2025-01-10 06:40:37,592 INFO L125 PetriNetUnfolderBase]: For 26023/26033 co-relation queries the response was YES. [2025-01-10 06:40:37,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28760 conditions, 7247 events. 4330/7247 cut-off events. For 26023/26033 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 46035 event pairs, 2278 based on Foata normal form. 48/6917 useless extension candidates. Maximal degree in co-relation 27886. Up to 4974 conditions per place. [2025-01-10 06:40:37,652 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 174 selfloop transitions, 111 changer transitions 4/291 dead transitions. [2025-01-10 06:40:37,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 291 transitions, 3286 flow [2025-01-10 06:40:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:40:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:40:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 190 transitions. [2025-01-10 06:40:37,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35984848484848486 [2025-01-10 06:40:37,654 INFO L175 Difference]: Start difference. First operand has 126 places, 191 transitions, 1913 flow. Second operand 12 states and 190 transitions. [2025-01-10 06:40:37,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 291 transitions, 3286 flow [2025-01-10 06:40:37,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 291 transitions, 3254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:40:37,803 INFO L231 Difference]: Finished difference. Result has 140 places, 234 transitions, 2752 flow [2025-01-10 06:40:37,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2752, PETRI_PLACES=140, PETRI_TRANSITIONS=234} [2025-01-10 06:40:37,805 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 95 predicate places. [2025-01-10 06:40:37,805 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 234 transitions, 2752 flow [2025-01-10 06:40:37,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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:40:37,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:37,806 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:40:37,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:40:37,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:37,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1206655160, now seen corresponding path program 1 times [2025-01-10 06:40:37,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:37,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582723611] [2025-01-10 06:40:37,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:37,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:37,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:37,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:37,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:37,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:38,249 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:40:38,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:38,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582723611] [2025-01-10 06:40:38,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582723611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:38,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:38,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:38,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234349777] [2025-01-10 06:40:38,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:38,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:38,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:38,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:38,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:38,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:38,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 234 transitions, 2752 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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:40:38,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:38,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:38,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:39,624 INFO L124 PetriNetUnfolderBase]: 4684/7901 cut-off events. [2025-01-10 06:40:39,624 INFO L125 PetriNetUnfolderBase]: For 34667/34677 co-relation queries the response was YES. [2025-01-10 06:40:39,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33998 conditions, 7901 events. 4684/7901 cut-off events. For 34667/34677 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 51875 event pairs, 2446 based on Foata normal form. 128/7653 useless extension candidates. Maximal degree in co-relation 32920. Up to 4667 conditions per place. [2025-01-10 06:40:39,682 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 212 selfloop transitions, 145 changer transitions 16/375 dead transitions. [2025-01-10 06:40:39,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 375 transitions, 4634 flow [2025-01-10 06:40:39,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 06:40:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 06:40:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 285 transitions. [2025-01-10 06:40:39,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2025-01-10 06:40:39,684 INFO L175 Difference]: Start difference. First operand has 140 places, 234 transitions, 2752 flow. Second operand 19 states and 285 transitions. [2025-01-10 06:40:39,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 375 transitions, 4634 flow [2025-01-10 06:40:39,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 375 transitions, 4530 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-01-10 06:40:39,854 INFO L231 Difference]: Finished difference. Result has 160 places, 266 transitions, 3515 flow [2025-01-10 06:40:39,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3515, PETRI_PLACES=160, PETRI_TRANSITIONS=266} [2025-01-10 06:40:39,855 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 115 predicate places. [2025-01-10 06:40:39,855 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 266 transitions, 3515 flow [2025-01-10 06:40:39,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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:40:39,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:39,856 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:40:39,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:40:39,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:39,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:39,856 INFO L85 PathProgramCache]: Analyzing trace with hash -57174645, now seen corresponding path program 1 times [2025-01-10 06:40:39,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:39,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89038197] [2025-01-10 06:40:39,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:39,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:39,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:39,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:39,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:39,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:40,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:40,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89038197] [2025-01-10 06:40:40,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89038197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:40,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:40,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:40,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963953462] [2025-01-10 06:40:40,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:40,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:40,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:40,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:40,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:40,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:40,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 266 transitions, 3515 flow. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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:40:40,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:40,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:40,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:41,442 INFO L124 PetriNetUnfolderBase]: 4906/8273 cut-off events. [2025-01-10 06:40:41,442 INFO L125 PetriNetUnfolderBase]: For 49182/49186 co-relation queries the response was YES. [2025-01-10 06:40:41,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38876 conditions, 8273 events. 4906/8273 cut-off events. For 49182/49186 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 54320 event pairs, 2625 based on Foata normal form. 46/7925 useless extension candidates. Maximal degree in co-relation 37641. Up to 5620 conditions per place. [2025-01-10 06:40:41,497 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 248 selfloop transitions, 120 changer transitions 11/381 dead transitions. [2025-01-10 06:40:41,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 381 transitions, 5306 flow [2025-01-10 06:40:41,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:40:41,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:40:41,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 202 transitions. [2025-01-10 06:40:41,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3531468531468531 [2025-01-10 06:40:41,498 INFO L175 Difference]: Start difference. First operand has 160 places, 266 transitions, 3515 flow. Second operand 13 states and 202 transitions. [2025-01-10 06:40:41,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 381 transitions, 5306 flow [2025-01-10 06:40:41,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 381 transitions, 5112 flow, removed 27 selfloop flow, removed 7 redundant places. [2025-01-10 06:40:41,683 INFO L231 Difference]: Finished difference. Result has 172 places, 317 transitions, 4396 flow [2025-01-10 06:40:41,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=3370, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4396, PETRI_PLACES=172, PETRI_TRANSITIONS=317} [2025-01-10 06:40:41,684 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 127 predicate places. [2025-01-10 06:40:41,684 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 317 transitions, 4396 flow [2025-01-10 06:40:41,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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:40:41,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:41,684 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:40:41,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:40:41,685 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:41,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:41,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1611662984, now seen corresponding path program 1 times [2025-01-10 06:40:41,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:41,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019898197] [2025-01-10 06:40:41,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:41,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:41,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:41,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:41,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:41,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:42,141 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:40:42,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:42,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019898197] [2025-01-10 06:40:42,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019898197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:42,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:42,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:42,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980813736] [2025-01-10 06:40:42,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:42,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:42,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:42,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:42,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:42,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:42,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 317 transitions, 4396 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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:40:42,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:42,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:42,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:43,933 INFO L124 PetriNetUnfolderBase]: 5378/9120 cut-off events. [2025-01-10 06:40:43,933 INFO L125 PetriNetUnfolderBase]: For 66450/66460 co-relation queries the response was YES. [2025-01-10 06:40:43,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45413 conditions, 9120 events. 5378/9120 cut-off events. For 66450/66460 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 61495 event pairs, 3000 based on Foata normal form. 106/8828 useless extension candidates. Maximal degree in co-relation 44279. Up to 6005 conditions per place. [2025-01-10 06:40:44,007 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 237 selfloop transitions, 166 changer transitions 10/415 dead transitions. [2025-01-10 06:40:44,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 415 transitions, 5938 flow [2025-01-10 06:40:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 06:40:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 06:40:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 297 transitions. [2025-01-10 06:40:44,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2025-01-10 06:40:44,009 INFO L175 Difference]: Start difference. First operand has 172 places, 317 transitions, 4396 flow. Second operand 21 states and 297 transitions. [2025-01-10 06:40:44,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 415 transitions, 5938 flow [2025-01-10 06:40:44,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 415 transitions, 5807 flow, removed 45 selfloop flow, removed 4 redundant places. [2025-01-10 06:40:44,323 INFO L231 Difference]: Finished difference. Result has 192 places, 337 transitions, 4951 flow [2025-01-10 06:40:44,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4297, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4951, PETRI_PLACES=192, PETRI_TRANSITIONS=337} [2025-01-10 06:40:44,324 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 147 predicate places. [2025-01-10 06:40:44,324 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 337 transitions, 4951 flow [2025-01-10 06:40:44,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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:40:44,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:44,325 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:40:44,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:40:44,325 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:44,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2116807446, now seen corresponding path program 2 times [2025-01-10 06:40:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:44,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144513925] [2025-01-10 06:40:44,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:44,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:44,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:44,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:44,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:44,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:44,616 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:40:44,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:44,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144513925] [2025-01-10 06:40:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144513925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:44,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:44,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:44,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000567904] [2025-01-10 06:40:44,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:44,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:44,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:44,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:44,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:44,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 337 transitions, 4951 flow. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:40:44,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:44,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:44,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:46,086 INFO L124 PetriNetUnfolderBase]: 5374/9254 cut-off events. [2025-01-10 06:40:46,086 INFO L125 PetriNetUnfolderBase]: For 73810/73816 co-relation queries the response was YES. [2025-01-10 06:40:46,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48305 conditions, 9254 events. 5374/9254 cut-off events. For 73810/73816 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 64956 event pairs, 1313 based on Foata normal form. 72/8872 useless extension candidates. Maximal degree in co-relation 47392. Up to 4336 conditions per place. [2025-01-10 06:40:46,140 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 482 selfloop transitions, 81 changer transitions 7/572 dead transitions. [2025-01-10 06:40:46,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 572 transitions, 9050 flow [2025-01-10 06:40:46,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:40:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:40:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 213 transitions. [2025-01-10 06:40:46,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4034090909090909 [2025-01-10 06:40:46,142 INFO L175 Difference]: Start difference. First operand has 192 places, 337 transitions, 4951 flow. Second operand 12 states and 213 transitions. [2025-01-10 06:40:46,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 572 transitions, 9050 flow [2025-01-10 06:40:46,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 572 transitions, 8698 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-01-10 06:40:46,384 INFO L231 Difference]: Finished difference. Result has 199 places, 366 transitions, 5245 flow [2025-01-10 06:40:46,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=4705, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5245, PETRI_PLACES=199, PETRI_TRANSITIONS=366} [2025-01-10 06:40:46,384 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 154 predicate places. [2025-01-10 06:40:46,384 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 366 transitions, 5245 flow [2025-01-10 06:40:46,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:40:46,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:46,385 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:40:46,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:40:46,385 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:46,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:46,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1256771727, now seen corresponding path program 2 times [2025-01-10 06:40:46,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:46,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364042042] [2025-01-10 06:40:46,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:46,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:46,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:46,402 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:46,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:46,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:46,795 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:40:46,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:46,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364042042] [2025-01-10 06:40:46,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364042042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:46,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:46,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:46,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429254265] [2025-01-10 06:40:46,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:46,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:46,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:46,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:46,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:46,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:46,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 366 transitions, 5245 flow. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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:40:46,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:46,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:46,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:48,508 INFO L124 PetriNetUnfolderBase]: 5449/9480 cut-off events. [2025-01-10 06:40:48,508 INFO L125 PetriNetUnfolderBase]: For 82621/82623 co-relation queries the response was YES. [2025-01-10 06:40:48,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52945 conditions, 9480 events. 5449/9480 cut-off events. For 82621/82623 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 66932 event pairs, 3094 based on Foata normal form. 40/9043 useless extension candidates. Maximal degree in co-relation 52151. Up to 6081 conditions per place. [2025-01-10 06:40:48,571 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 295 selfloop transitions, 172 changer transitions 5/474 dead transitions. [2025-01-10 06:40:48,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 474 transitions, 7268 flow [2025-01-10 06:40:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:40:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:40:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 225 transitions. [2025-01-10 06:40:48,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2025-01-10 06:40:48,573 INFO L175 Difference]: Start difference. First operand has 199 places, 366 transitions, 5245 flow. Second operand 15 states and 225 transitions. [2025-01-10 06:40:48,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 474 transitions, 7268 flow [2025-01-10 06:40:48,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 474 transitions, 7178 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-01-10 06:40:48,859 INFO L231 Difference]: Finished difference. Result has 214 places, 398 transitions, 6096 flow [2025-01-10 06:40:48,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=5195, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6096, PETRI_PLACES=214, PETRI_TRANSITIONS=398} [2025-01-10 06:40:48,860 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 169 predicate places. [2025-01-10 06:40:48,860 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 398 transitions, 6096 flow [2025-01-10 06:40:48,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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:40:48,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:48,860 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:40:48,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:40:48,860 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:48,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:48,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1396464796, now seen corresponding path program 3 times [2025-01-10 06:40:48,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:48,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748926388] [2025-01-10 06:40:48,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:48,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:48,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:48,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:48,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:48,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:49,147 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:40:49,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:49,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748926388] [2025-01-10 06:40:49,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748926388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:49,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:49,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:49,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018727537] [2025-01-10 06:40:49,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:49,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:49,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:49,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:49,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:49,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:49,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 398 transitions, 6096 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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:40:49,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:49,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:49,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:51,074 INFO L124 PetriNetUnfolderBase]: 5799/10152 cut-off events. [2025-01-10 06:40:51,074 INFO L125 PetriNetUnfolderBase]: For 100675/100677 co-relation queries the response was YES. [2025-01-10 06:40:51,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58433 conditions, 10152 events. 5799/10152 cut-off events. For 100675/100677 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 73684 event pairs, 3342 based on Foata normal form. 130/9803 useless extension candidates. Maximal degree in co-relation 57832. Up to 6847 conditions per place. [2025-01-10 06:40:51,136 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 321 selfloop transitions, 154 changer transitions 22/499 dead transitions. [2025-01-10 06:40:51,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 499 transitions, 8016 flow [2025-01-10 06:40:51,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:40:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:40:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 227 transitions. [2025-01-10 06:40:51,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34393939393939393 [2025-01-10 06:40:51,138 INFO L175 Difference]: Start difference. First operand has 214 places, 398 transitions, 6096 flow. Second operand 15 states and 227 transitions. [2025-01-10 06:40:51,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 499 transitions, 8016 flow [2025-01-10 06:40:51,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 499 transitions, 7786 flow, removed 52 selfloop flow, removed 6 redundant places. [2025-01-10 06:40:51,478 INFO L231 Difference]: Finished difference. Result has 225 places, 404 transitions, 6340 flow [2025-01-10 06:40:51,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=5878, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=148, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6340, PETRI_PLACES=225, PETRI_TRANSITIONS=404} [2025-01-10 06:40:51,479 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 180 predicate places. [2025-01-10 06:40:51,479 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 404 transitions, 6340 flow [2025-01-10 06:40:51,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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:40:51,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:51,479 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:40:51,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:40:51,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:51,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1846030765, now seen corresponding path program 2 times [2025-01-10 06:40:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:51,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640334363] [2025-01-10 06:40:51,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:51,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:51,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:40:51,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:40:51,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:51,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:51,767 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:40:51,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:51,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640334363] [2025-01-10 06:40:51,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640334363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:51,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:51,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:51,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60009159] [2025-01-10 06:40:51,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:51,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:51,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:51,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:51,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:51,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:51,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 404 transitions, 6340 flow. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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:40:51,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:51,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:51,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:54,025 INFO L124 PetriNetUnfolderBase]: 5576/9731 cut-off events. [2025-01-10 06:40:54,026 INFO L125 PetriNetUnfolderBase]: For 102404/102410 co-relation queries the response was YES. [2025-01-10 06:40:54,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57839 conditions, 9731 events. 5576/9731 cut-off events. For 102404/102410 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 69916 event pairs, 3180 based on Foata normal form. 48/9286 useless extension candidates. Maximal degree in co-relation 57243. Up to 7275 conditions per place. [2025-01-10 06:40:54,149 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 349 selfloop transitions, 164 changer transitions 14/529 dead transitions. [2025-01-10 06:40:54,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 529 transitions, 8753 flow [2025-01-10 06:40:54,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:40:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:40:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 226 transitions. [2025-01-10 06:40:54,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3424242424242424 [2025-01-10 06:40:54,152 INFO L175 Difference]: Start difference. First operand has 225 places, 404 transitions, 6340 flow. Second operand 15 states and 226 transitions. [2025-01-10 06:40:54,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 529 transitions, 8753 flow [2025-01-10 06:40:54,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 529 transitions, 8389 flow, removed 35 selfloop flow, removed 11 redundant places. [2025-01-10 06:40:54,616 INFO L231 Difference]: Finished difference. Result has 234 places, 446 transitions, 7056 flow [2025-01-10 06:40:54,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6031, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7056, PETRI_PLACES=234, PETRI_TRANSITIONS=446} [2025-01-10 06:40:54,617 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 189 predicate places. [2025-01-10 06:40:54,617 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 446 transitions, 7056 flow [2025-01-10 06:40:54,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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:40:54,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:54,617 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:40:54,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:40:54,617 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:54,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1294105037, now seen corresponding path program 1 times [2025-01-10 06:40:54,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:54,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462967174] [2025-01-10 06:40:54,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:54,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:40:54,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:40:54,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:54,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:55,013 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:40:55,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:55,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462967174] [2025-01-10 06:40:55,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462967174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:55,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:55,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:55,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136932404] [2025-01-10 06:40:55,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:55,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:55,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:55,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:55,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:55,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:55,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 446 transitions, 7056 flow. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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:40:55,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:55,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:55,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:58,117 INFO L124 PetriNetUnfolderBase]: 10307/18614 cut-off events. [2025-01-10 06:40:58,118 INFO L125 PetriNetUnfolderBase]: For 225363/225365 co-relation queries the response was YES. [2025-01-10 06:40:58,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110129 conditions, 18614 events. 10307/18614 cut-off events. For 225363/225365 co-relation queries the response was YES. Maximal size of possible extension queue 1070. Compared 158582 event pairs, 3082 based on Foata normal form. 198/17841 useless extension candidates. Maximal degree in co-relation 109447. Up to 5723 conditions per place. [2025-01-10 06:40:58,337 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 546 selfloop transitions, 98 changer transitions 9/655 dead transitions. [2025-01-10 06:40:58,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 655 transitions, 10779 flow [2025-01-10 06:40:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:40:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:40:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2025-01-10 06:40:58,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45867768595041325 [2025-01-10 06:40:58,338 INFO L175 Difference]: Start difference. First operand has 234 places, 446 transitions, 7056 flow. Second operand 11 states and 222 transitions. [2025-01-10 06:40:58,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 655 transitions, 10779 flow [2025-01-10 06:40:59,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 655 transitions, 10590 flow, removed 78 selfloop flow, removed 3 redundant places. [2025-01-10 06:40:59,404 INFO L231 Difference]: Finished difference. Result has 246 places, 470 transitions, 7537 flow [2025-01-10 06:40:59,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6941, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7537, PETRI_PLACES=246, PETRI_TRANSITIONS=470} [2025-01-10 06:40:59,405 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 201 predicate places. [2025-01-10 06:40:59,405 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 470 transitions, 7537 flow [2025-01-10 06:40:59,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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:40:59,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:59,405 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:40:59,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:40:59,405 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:59,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:59,406 INFO L85 PathProgramCache]: Analyzing trace with hash -207451725, now seen corresponding path program 1 times [2025-01-10 06:40:59,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:59,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024784468] [2025-01-10 06:40:59,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:59,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:59,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:40:59,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:40:59,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:59,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:59,689 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:40:59,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:59,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024784468] [2025-01-10 06:40:59,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024784468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:59,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:59,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:59,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750450279] [2025-01-10 06:40:59,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:59,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:59,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:59,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:59,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:59,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:40:59,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 470 transitions, 7537 flow. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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:40:59,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:59,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:40:59,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:06,137 INFO L124 PetriNetUnfolderBase]: 18401/33921 cut-off events. [2025-01-10 06:41:06,137 INFO L125 PetriNetUnfolderBase]: For 513019/513025 co-relation queries the response was YES. [2025-01-10 06:41:06,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217681 conditions, 33921 events. 18401/33921 cut-off events. For 513019/513025 co-relation queries the response was YES. Maximal size of possible extension queue 2179. Compared 326121 event pairs, 7071 based on Foata normal form. 512/32627 useless extension candidates. Maximal degree in co-relation 216829. Up to 13847 conditions per place. [2025-01-10 06:41:06,451 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 590 selfloop transitions, 115 changer transitions 22/729 dead transitions. [2025-01-10 06:41:06,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 729 transitions, 12352 flow [2025-01-10 06:41:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:41:06,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:41:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 229 transitions. [2025-01-10 06:41:06,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4731404958677686 [2025-01-10 06:41:06,453 INFO L175 Difference]: Start difference. First operand has 246 places, 470 transitions, 7537 flow. Second operand 11 states and 229 transitions. [2025-01-10 06:41:06,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 729 transitions, 12352 flow [2025-01-10 06:41:09,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 729 transitions, 12120 flow, removed 96 selfloop flow, removed 3 redundant places. [2025-01-10 06:41:09,015 INFO L231 Difference]: Finished difference. Result has 258 places, 499 transitions, 8271 flow [2025-01-10 06:41:09,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=7461, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8271, PETRI_PLACES=258, PETRI_TRANSITIONS=499} [2025-01-10 06:41:09,016 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 213 predicate places. [2025-01-10 06:41:09,016 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 499 transitions, 8271 flow [2025-01-10 06:41:09,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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:41:09,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:09,016 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:41:09,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:41:09,017 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:41:09,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:09,017 INFO L85 PathProgramCache]: Analyzing trace with hash -803183727, now seen corresponding path program 2 times [2025-01-10 06:41:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:09,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883656254] [2025-01-10 06:41:09,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:41:09,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:09,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:41:09,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:41:09,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:41:09,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:09,512 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:41:09,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:09,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883656254] [2025-01-10 06:41:09,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883656254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:09,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:09,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:41:09,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582753601] [2025-01-10 06:41:09,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:09,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:41:09,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:09,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:41:09,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:41:09,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:41:09,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 499 transitions, 8271 flow. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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:41:09,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:09,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:41:09,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:17,559 INFO L124 PetriNetUnfolderBase]: 21032/39149 cut-off events. [2025-01-10 06:41:17,559 INFO L125 PetriNetUnfolderBase]: For 718386/718392 co-relation queries the response was YES. [2025-01-10 06:41:17,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272402 conditions, 39149 events. 21032/39149 cut-off events. For 718386/718392 co-relation queries the response was YES. Maximal size of possible extension queue 2547. Compared 388064 event pairs, 9128 based on Foata normal form. 315/37427 useless extension candidates. Maximal degree in co-relation 271557. Up to 20637 conditions per place. [2025-01-10 06:41:18,056 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 609 selfloop transitions, 107 changer transitions 18/736 dead transitions. [2025-01-10 06:41:18,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 736 transitions, 13009 flow [2025-01-10 06:41:18,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:41:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:41:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 209 transitions. [2025-01-10 06:41:18,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-01-10 06:41:18,058 INFO L175 Difference]: Start difference. First operand has 258 places, 499 transitions, 8271 flow. Second operand 10 states and 209 transitions. [2025-01-10 06:41:18,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 736 transitions, 13009 flow [2025-01-10 06:41:21,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 736 transitions, 12738 flow, removed 82 selfloop flow, removed 5 redundant places. [2025-01-10 06:41:21,553 INFO L231 Difference]: Finished difference. Result has 267 places, 528 transitions, 8946 flow [2025-01-10 06:41:21,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8125, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8946, PETRI_PLACES=267, PETRI_TRANSITIONS=528} [2025-01-10 06:41:21,553 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 222 predicate places. [2025-01-10 06:41:21,554 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 528 transitions, 8946 flow [2025-01-10 06:41:21,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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:41:21,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:21,554 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:41:21,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:41:21,554 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:41:21,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:21,555 INFO L85 PathProgramCache]: Analyzing trace with hash 390536947, now seen corresponding path program 3 times [2025-01-10 06:41:21,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:21,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427100912] [2025-01-10 06:41:21,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:41:21,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:21,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:41:21,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:41:21,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:41:21,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:21,973 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:41:21,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427100912] [2025-01-10 06:41:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427100912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:21,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:41:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292221825] [2025-01-10 06:41:21,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:21,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:41:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:21,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:41:21,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:41:21,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:41:21,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 528 transitions, 8946 flow. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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:41:21,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:21,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:41:21,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:30,810 INFO L124 PetriNetUnfolderBase]: 21769/40870 cut-off events. [2025-01-10 06:41:30,811 INFO L125 PetriNetUnfolderBase]: For 820869/820875 co-relation queries the response was YES. [2025-01-10 06:41:31,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298086 conditions, 40870 events. 21769/40870 cut-off events. For 820869/820875 co-relation queries the response was YES. Maximal size of possible extension queue 2665. Compared 411502 event pairs, 5789 based on Foata normal form. 118/38892 useless extension candidates. Maximal degree in co-relation 297223. Up to 21552 conditions per place. [2025-01-10 06:41:31,501 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 503 selfloop transitions, 188 changer transitions 28/721 dead transitions. [2025-01-10 06:41:31,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 721 transitions, 13246 flow [2025-01-10 06:41:31,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:41:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:41:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 240 transitions. [2025-01-10 06:41:31,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4195804195804196 [2025-01-10 06:41:31,503 INFO L175 Difference]: Start difference. First operand has 267 places, 528 transitions, 8946 flow. Second operand 13 states and 240 transitions. [2025-01-10 06:41:31,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 721 transitions, 13246 flow [2025-01-10 06:41:35,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 721 transitions, 12789 flow, removed 173 selfloop flow, removed 4 redundant places. [2025-01-10 06:41:35,579 INFO L231 Difference]: Finished difference. Result has 283 places, 580 transitions, 10256 flow [2025-01-10 06:41:35,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=8709, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10256, PETRI_PLACES=283, PETRI_TRANSITIONS=580} [2025-01-10 06:41:35,580 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 238 predicate places. [2025-01-10 06:41:35,580 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 580 transitions, 10256 flow [2025-01-10 06:41:35,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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:41:35,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:35,580 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:41:35,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:41:35,580 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:41:35,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:35,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1365947995, now seen corresponding path program 2 times [2025-01-10 06:41:35,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:35,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060203412] [2025-01-10 06:41:35,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:41:35,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:35,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:41:35,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:41:35,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:41:35,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:35,916 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:41:35,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:35,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060203412] [2025-01-10 06:41:35,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060203412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:41:35,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:41:35,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:41:35,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841869288] [2025-01-10 06:41:35,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:41:35,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:41:35,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:35,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:41:35,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:41:35,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2025-01-10 06:41:35,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 580 transitions, 10256 flow. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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:41:35,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:35,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2025-01-10 06:41:35,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand