./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.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-3_2-container_of-global.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 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:40:22,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:40:22,348 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:22,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:40:22,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:40:22,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:40:22,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:40:22,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:40:22,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:40:22,397 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:40:22,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:40:22,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:40:22,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:40:22,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:40:22,398 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:40:22,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:40:22,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:40:22,398 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:40:22,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:40:22,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:40:22,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:40:22,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:40:22,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:40:22,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:40:22,399 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:40:22,399 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:40:22,399 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:40:22,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:40:22,399 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:40:22,399 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:40:22,399 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:40:22,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:40:22,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:40:22,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:40:22,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:40:22,400 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:40:22,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:40:22,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:40:22,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:40:22,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:40:22,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:40:22,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:40:22,400 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:40:22,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:40:22,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:40:22,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:40:22,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:40:22,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:40:22,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:40:22,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:40:22,400 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 -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 [2025-01-10 06:40:22,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:40:22,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:40:22,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:40:22,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:40:22,692 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:40:22,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2025-01-10 06:40:23,890 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f43bf0b38/00d6087c0d894c4f9cc9c9e96621608a/FLAG40cf8b178 [2025-01-10 06:40:24,305 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:40:24,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2025-01-10 06:40:24,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f43bf0b38/00d6087c0d894c4f9cc9c9e96621608a/FLAG40cf8b178 [2025-01-10 06:40:24,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f43bf0b38/00d6087c0d894c4f9cc9c9e96621608a [2025-01-10 06:40:24,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:40:24,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:40:24,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:40:24,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:40:24,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:40:24,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:40:24" (1/1) ... [2025-01-10 06:40:24,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7015c3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:24, skipping insertion in model container [2025-01-10 06:40:24,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:40:24" (1/1) ... [2025-01-10 06:40:24,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:40:24,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:40:24,786 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:40:24,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:40:24,867 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:40:24,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:24 WrapperNode [2025-01-10 06:40:24,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:40:24,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:40:24,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:40:24,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:40:24,881 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:24" (1/1) ... [2025-01-10 06:40:24,904 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:24" (1/1) ... [2025-01-10 06:40:24,934 INFO L138 Inliner]: procedures = 246, calls = 44, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 145 [2025-01-10 06:40:24,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:40:24,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:40:24,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:40:24,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:40:24,946 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:24" (1/1) ... [2025-01-10 06:40:24,948 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:24" (1/1) ... [2025-01-10 06:40:24,954 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:24" (1/1) ... [2025-01-10 06:40:24,974 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 2, 13]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 2, 6]. [2025-01-10 06:40:24,977 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:24" (1/1) ... [2025-01-10 06:40:24,978 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:24" (1/1) ... [2025-01-10 06:40:24,990 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:24" (1/1) ... [2025-01-10 06:40:24,994 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:24" (1/1) ... [2025-01-10 06:40:24,996 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:24" (1/1) ... [2025-01-10 06:40:25,003 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:24" (1/1) ... [2025-01-10 06:40:25,004 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:24" (1/1) ... [2025-01-10 06:40:25,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:40:25,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:40:25,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:40:25,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:40:25,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:24" (1/1) ... [2025-01-10 06:40:25,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:40:25,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:40:25,053 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:25,058 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:25,076 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-01-10 06:40:25,076 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-01-10 06:40:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:40:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:40:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:40:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:40:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:40:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:40:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:40:25,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:40:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:40:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:40:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:40:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:40:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:40:25,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:40:25,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:40:25,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:40:25,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:40:25,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:40:25,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:40:25,080 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:25,293 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:40:25,295 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:40:25,472 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:40:25,472 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:40:25,613 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:40:25,613 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:40:25,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:40:25 BoogieIcfgContainer [2025-01-10 06:40:25,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:40:25,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:40:25,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:40:25,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:40:25,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:40:24" (1/3) ... [2025-01-10 06:40:25,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207f80c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:40:25, skipping insertion in model container [2025-01-10 06:40:25,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:24" (2/3) ... [2025-01-10 06:40:25,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207f80c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:40:25, skipping insertion in model container [2025-01-10 06:40:25,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:40:25" (3/3) ... [2025-01-10 06:40:25,621 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2025-01-10 06:40:25,631 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:40:25,633 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_2-container_of-global.i that has 2 procedures, 24 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-10 06:40:25,633 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:40:25,666 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:40:25,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 34 transitions, 82 flow [2025-01-10 06:40:25,708 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2025-01-10 06:40:25,710 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:40:25,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 37 events. 2/37 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 72 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 21. Up to 3 conditions per place. [2025-01-10 06:40:25,712 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 34 transitions, 82 flow [2025-01-10 06:40:25,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 65 flow [2025-01-10 06:40:25,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:40:25,731 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;@229ad2b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:40:25,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 06:40:25,736 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:40:25,736 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-01-10 06:40:25,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:40:25,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:25,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:25,737 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:25,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:25,741 INFO L85 PathProgramCache]: Analyzing trace with hash -504691518, now seen corresponding path program 1 times [2025-01-10 06:40:25,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:25,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315550209] [2025-01-10 06:40:25,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:25,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:25,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:40:25,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:40:25,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:25,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:26,417 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,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315550209] [2025-01-10 06:40:26,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315550209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:26,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:26,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:40:26,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647161201] [2025-01-10 06:40:26,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:26,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:40:26,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:26,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:40:26,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:40:26,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:26,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 65 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:26,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:26,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:26,827 INFO L124 PetriNetUnfolderBase]: 769/1310 cut-off events. [2025-01-10 06:40:26,828 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-10 06:40:26,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2642 conditions, 1310 events. 769/1310 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6493 event pairs, 367 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 2572. Up to 850 conditions per place. [2025-01-10 06:40:26,838 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 63 selfloop transitions, 20 changer transitions 2/86 dead transitions. [2025-01-10 06:40:26,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 86 transitions, 366 flow [2025-01-10 06:40:26,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:40:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:40:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2025-01-10 06:40:26,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37941176470588234 [2025-01-10 06:40:26,849 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 65 flow. Second operand 10 states and 129 transitions. [2025-01-10 06:40:26,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 86 transitions, 366 flow [2025-01-10 06:40:26,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 86 transitions, 355 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:40:26,855 INFO L231 Difference]: Finished difference. Result has 46 places, 48 transitions, 188 flow [2025-01-10 06:40:26,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=188, PETRI_PLACES=46, PETRI_TRANSITIONS=48} [2025-01-10 06:40:26,861 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2025-01-10 06:40:26,861 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 48 transitions, 188 flow [2025-01-10 06:40:26,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:26,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:26,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:40:26,862 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:26,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:26,863 INFO L85 PathProgramCache]: Analyzing trace with hash -263510488, now seen corresponding path program 1 times [2025-01-10 06:40:26,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:26,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621196750] [2025-01-10 06:40:26,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:26,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:26,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:40:26,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:40:26,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:26,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:27,184 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:27,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:27,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621196750] [2025-01-10 06:40:27,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621196750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:27,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:27,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:40:27,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697235582] [2025-01-10 06:40:27,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:27,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:40:27,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:27,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:40:27,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:40:27,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:27,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 48 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:27,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:27,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:27,605 INFO L124 PetriNetUnfolderBase]: 899/1554 cut-off events. [2025-01-10 06:40:27,606 INFO L125 PetriNetUnfolderBase]: For 770/770 co-relation queries the response was YES. [2025-01-10 06:40:27,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 1554 events. 899/1554 cut-off events. For 770/770 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 8185 event pairs, 569 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 3585. Up to 1126 conditions per place. [2025-01-10 06:40:27,617 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 63 selfloop transitions, 26 changer transitions 4/94 dead transitions. [2025-01-10 06:40:27,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 94 transitions, 534 flow [2025-01-10 06:40:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:40:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:40:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2025-01-10 06:40:27,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36176470588235293 [2025-01-10 06:40:27,619 INFO L175 Difference]: Start difference. First operand has 46 places, 48 transitions, 188 flow. Second operand 10 states and 123 transitions. [2025-01-10 06:40:27,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 94 transitions, 534 flow [2025-01-10 06:40:27,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 94 transitions, 532 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:40:27,625 INFO L231 Difference]: Finished difference. Result has 57 places, 62 transitions, 327 flow [2025-01-10 06:40:27,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=327, PETRI_PLACES=57, PETRI_TRANSITIONS=62} [2025-01-10 06:40:27,626 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2025-01-10 06:40:27,626 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 62 transitions, 327 flow [2025-01-10 06:40:27,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:27,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:27,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:40:27,626 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,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:27,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1753387897, now seen corresponding path program 1 times [2025-01-10 06:40:27,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:27,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301850546] [2025-01-10 06:40:27,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:27,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:27,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:27,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:40:27,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:27,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:28,073 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,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:28,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301850546] [2025-01-10 06:40:28,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301850546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:28,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:28,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:28,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657800464] [2025-01-10 06:40:28,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:28,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:28,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:28,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:28,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:28,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:28,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 327 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:28,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:28,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:28,844 INFO L124 PetriNetUnfolderBase]: 1170/2023 cut-off events. [2025-01-10 06:40:28,844 INFO L125 PetriNetUnfolderBase]: For 1932/1943 co-relation queries the response was YES. [2025-01-10 06:40:28,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6072 conditions, 2023 events. 1170/2023 cut-off events. For 1932/1943 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 11433 event pairs, 391 based on Foata normal form. 69/1950 useless extension candidates. Maximal degree in co-relation 5974. Up to 1101 conditions per place. [2025-01-10 06:40:28,859 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 80 selfloop transitions, 47 changer transitions 7/135 dead transitions. [2025-01-10 06:40:28,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 135 transitions, 884 flow [2025-01-10 06:40:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:40:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:40:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 194 transitions. [2025-01-10 06:40:28,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3356401384083045 [2025-01-10 06:40:28,862 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 327 flow. Second operand 17 states and 194 transitions. [2025-01-10 06:40:28,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 135 transitions, 884 flow [2025-01-10 06:40:28,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 135 transitions, 882 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:40:28,880 INFO L231 Difference]: Finished difference. Result has 76 places, 78 transitions, 557 flow [2025-01-10 06:40:28,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=557, PETRI_PLACES=76, PETRI_TRANSITIONS=78} [2025-01-10 06:40:28,885 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 41 predicate places. [2025-01-10 06:40:28,885 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 78 transitions, 557 flow [2025-01-10 06:40:28,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:28,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:28,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:40:28,886 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:28,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:28,886 INFO L85 PathProgramCache]: Analyzing trace with hash -37422999, now seen corresponding path program 1 times [2025-01-10 06:40:28,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:28,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692823784] [2025-01-10 06:40:28,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:28,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:28,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:28,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:40:28,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:28,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:29,326 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:29,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:29,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692823784] [2025-01-10 06:40:29,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692823784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:29,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:29,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:29,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869909970] [2025-01-10 06:40:29,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:29,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:29,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:29,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:29,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:29,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:29,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 78 transitions, 557 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:29,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:29,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:29,872 INFO L124 PetriNetUnfolderBase]: 1249/2203 cut-off events. [2025-01-10 06:40:29,872 INFO L125 PetriNetUnfolderBase]: For 4363/4374 co-relation queries the response was YES. [2025-01-10 06:40:29,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7852 conditions, 2203 events. 1249/2203 cut-off events. For 4363/4374 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13000 event pairs, 679 based on Foata normal form. 45/2098 useless extension candidates. Maximal degree in co-relation 7740. Up to 1287 conditions per place. [2025-01-10 06:40:29,887 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 77 selfloop transitions, 41 changer transitions 5/124 dead transitions. [2025-01-10 06:40:29,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 124 transitions, 1011 flow [2025-01-10 06:40:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:40:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:40:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 153 transitions. [2025-01-10 06:40:29,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-01-10 06:40:29,892 INFO L175 Difference]: Start difference. First operand has 76 places, 78 transitions, 557 flow. Second operand 12 states and 153 transitions. [2025-01-10 06:40:29,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 124 transitions, 1011 flow [2025-01-10 06:40:29,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 882 flow, removed 18 selfloop flow, removed 13 redundant places. [2025-01-10 06:40:29,915 INFO L231 Difference]: Finished difference. Result has 77 places, 82 transitions, 584 flow [2025-01-10 06:40:29,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=584, PETRI_PLACES=77, PETRI_TRANSITIONS=82} [2025-01-10 06:40:29,916 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 42 predicate places. [2025-01-10 06:40:29,916 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 584 flow [2025-01-10 06:40:29,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:29,917 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:29,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:40:29,917 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:29,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash -31858585, now seen corresponding path program 2 times [2025-01-10 06:40:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:29,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628636755] [2025-01-10 06:40:29,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:29,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:29,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:29,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:40:29,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:29,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:30,330 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,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:30,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628636755] [2025-01-10 06:40:30,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628636755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:30,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:30,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:30,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949327558] [2025-01-10 06:40:30,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:30,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:30,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:30,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:30,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:30,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:30,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 82 transitions, 584 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:30,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:30,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:30,958 INFO L124 PetriNetUnfolderBase]: 1484/2586 cut-off events. [2025-01-10 06:40:30,959 INFO L125 PetriNetUnfolderBase]: For 5677/5681 co-relation queries the response was YES. [2025-01-10 06:40:30,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9644 conditions, 2586 events. 1484/2586 cut-off events. For 5677/5681 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 15610 event pairs, 522 based on Foata normal form. 62/2472 useless extension candidates. Maximal degree in co-relation 9527. Up to 1326 conditions per place. [2025-01-10 06:40:30,978 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 88 selfloop transitions, 69 changer transitions 8/166 dead transitions. [2025-01-10 06:40:30,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 166 transitions, 1393 flow [2025-01-10 06:40:30,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 06:40:30,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 06:40:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 209 transitions. [2025-01-10 06:40:30,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3415032679738562 [2025-01-10 06:40:30,980 INFO L175 Difference]: Start difference. First operand has 77 places, 82 transitions, 584 flow. Second operand 18 states and 209 transitions. [2025-01-10 06:40:30,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 166 transitions, 1393 flow [2025-01-10 06:40:30,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 166 transitions, 1317 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 06:40:30,991 INFO L231 Difference]: Finished difference. Result has 93 places, 105 transitions, 941 flow [2025-01-10 06:40:30,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=941, PETRI_PLACES=93, PETRI_TRANSITIONS=105} [2025-01-10 06:40:30,992 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2025-01-10 06:40:30,992 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 105 transitions, 941 flow [2025-01-10 06:40:30,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:30,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:30,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:40:30,993 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:30,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:30,994 INFO L85 PathProgramCache]: Analyzing trace with hash -32060619, now seen corresponding path program 2 times [2025-01-10 06:40:30,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:30,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389937663] [2025-01-10 06:40:30,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:30,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:31,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:31,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:40:31,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:31,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:31,288 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:31,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:31,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389937663] [2025-01-10 06:40:31,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389937663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:31,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:31,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:31,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57680855] [2025-01-10 06:40:31,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:31,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:31,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:31,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:31,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:31,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:31,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 105 transitions, 941 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:31,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:31,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:31,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:31,900 INFO L124 PetriNetUnfolderBase]: 1588/2831 cut-off events. [2025-01-10 06:40:31,900 INFO L125 PetriNetUnfolderBase]: For 10506/10514 co-relation queries the response was YES. [2025-01-10 06:40:31,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11935 conditions, 2831 events. 1588/2831 cut-off events. For 10506/10514 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 17813 event pairs, 850 based on Foata normal form. 60/2711 useless extension candidates. Maximal degree in co-relation 11808. Up to 1496 conditions per place. [2025-01-10 06:40:31,917 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 87 selfloop transitions, 63 changer transitions 6/157 dead transitions. [2025-01-10 06:40:31,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 157 transitions, 1515 flow [2025-01-10 06:40:31,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:40:31,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:40:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 175 transitions. [2025-01-10 06:40:31,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2025-01-10 06:40:31,919 INFO L175 Difference]: Start difference. First operand has 93 places, 105 transitions, 941 flow. Second operand 14 states and 175 transitions. [2025-01-10 06:40:31,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 157 transitions, 1515 flow [2025-01-10 06:40:31,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 157 transitions, 1432 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-01-10 06:40:31,938 INFO L231 Difference]: Finished difference. Result has 101 places, 108 transitions, 1070 flow [2025-01-10 06:40:31,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1070, PETRI_PLACES=101, PETRI_TRANSITIONS=108} [2025-01-10 06:40:31,939 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 66 predicate places. [2025-01-10 06:40:31,939 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 108 transitions, 1070 flow [2025-01-10 06:40:31,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:31,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:31,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:31,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:40:31,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:31,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:31,941 INFO L85 PathProgramCache]: Analyzing trace with hash 169230665, now seen corresponding path program 3 times [2025-01-10 06:40:31,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:31,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108100708] [2025-01-10 06:40:31,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:31,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:31,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:31,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:40:31,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:31,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:32,246 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,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:32,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108100708] [2025-01-10 06:40:32,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108100708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:32,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:32,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:32,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155405125] [2025-01-10 06:40:32,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:32,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:32,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:32,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:32,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:32,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:32,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 108 transitions, 1070 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:32,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:32,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:32,924 INFO L124 PetriNetUnfolderBase]: 1674/2938 cut-off events. [2025-01-10 06:40:32,924 INFO L125 PetriNetUnfolderBase]: For 13002/13015 co-relation queries the response was YES. [2025-01-10 06:40:32,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13332 conditions, 2938 events. 1674/2938 cut-off events. For 13002/13015 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 18391 event pairs, 918 based on Foata normal form. 48/2780 useless extension candidates. Maximal degree in co-relation 12063. Up to 2093 conditions per place. [2025-01-10 06:40:32,942 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 107 selfloop transitions, 51 changer transitions 6/165 dead transitions. [2025-01-10 06:40:32,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 165 transitions, 1812 flow [2025-01-10 06:40:32,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:40:32,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:40:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 151 transitions. [2025-01-10 06:40:32,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3700980392156863 [2025-01-10 06:40:32,943 INFO L175 Difference]: Start difference. First operand has 101 places, 108 transitions, 1070 flow. Second operand 12 states and 151 transitions. [2025-01-10 06:40:32,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 165 transitions, 1812 flow [2025-01-10 06:40:32,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 165 transitions, 1708 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-01-10 06:40:32,969 INFO L231 Difference]: Finished difference. Result has 109 places, 121 transitions, 1284 flow [2025-01-10 06:40:32,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1284, PETRI_PLACES=109, PETRI_TRANSITIONS=121} [2025-01-10 06:40:32,969 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 74 predicate places. [2025-01-10 06:40:32,970 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 121 transitions, 1284 flow [2025-01-10 06:40:32,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:32,970 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:32,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:40:32,970 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:32,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:32,971 INFO L85 PathProgramCache]: Analyzing trace with hash 162080825, now seen corresponding path program 4 times [2025-01-10 06:40:32,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:32,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730758244] [2025-01-10 06:40:32,971 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:40:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:32,983 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 12 statements into 2 equivalence classes. [2025-01-10 06:40:32,988 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:40:32,988 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:40:32,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:33,247 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:33,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:33,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730758244] [2025-01-10 06:40:33,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730758244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:33,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:33,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:33,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096169230] [2025-01-10 06:40:33,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:33,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:33,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:33,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:33,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:33,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:33,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 121 transitions, 1284 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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:33,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:33,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:33,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:33,952 INFO L124 PetriNetUnfolderBase]: 1687/3017 cut-off events. [2025-01-10 06:40:33,953 INFO L125 PetriNetUnfolderBase]: For 15362/15378 co-relation queries the response was YES. [2025-01-10 06:40:33,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14008 conditions, 3017 events. 1687/3017 cut-off events. For 15362/15378 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 19354 event pairs, 844 based on Foata normal form. 70/2903 useless extension candidates. Maximal degree in co-relation 12623. Up to 1740 conditions per place. [2025-01-10 06:40:33,975 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 114 selfloop transitions, 64 changer transitions 8/187 dead transitions. [2025-01-10 06:40:33,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 187 transitions, 2168 flow [2025-01-10 06:40:33,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:40:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:40:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 173 transitions. [2025-01-10 06:40:33,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3634453781512605 [2025-01-10 06:40:33,977 INFO L175 Difference]: Start difference. First operand has 109 places, 121 transitions, 1284 flow. Second operand 14 states and 173 transitions. [2025-01-10 06:40:33,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 187 transitions, 2168 flow [2025-01-10 06:40:34,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 187 transitions, 2026 flow, removed 26 selfloop flow, removed 8 redundant places. [2025-01-10 06:40:34,014 INFO L231 Difference]: Finished difference. Result has 117 places, 134 transitions, 1514 flow [2025-01-10 06:40:34,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1514, PETRI_PLACES=117, PETRI_TRANSITIONS=134} [2025-01-10 06:40:34,015 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 82 predicate places. [2025-01-10 06:40:34,016 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 134 transitions, 1514 flow [2025-01-10 06:40:34,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:34,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:34,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:40:34,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:34,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:34,017 INFO L85 PathProgramCache]: Analyzing trace with hash 161878791, now seen corresponding path program 3 times [2025-01-10 06:40:34,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:34,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420293960] [2025-01-10 06:40:34,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:34,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:34,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:34,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:40:34,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:34,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:34,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:34,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420293960] [2025-01-10 06:40:34,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420293960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:34,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:34,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:34,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579634433] [2025-01-10 06:40:34,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:34,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:34,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:34,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:34,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:34,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:34,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 134 transitions, 1514 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:34,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:34,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:35,123 INFO L124 PetriNetUnfolderBase]: 1700/3117 cut-off events. [2025-01-10 06:40:35,123 INFO L125 PetriNetUnfolderBase]: For 21815/21819 co-relation queries the response was YES. [2025-01-10 06:40:35,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15396 conditions, 3117 events. 1700/3117 cut-off events. For 21815/21819 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 20771 event pairs, 828 based on Foata normal form. 82/3033 useless extension candidates. Maximal degree in co-relation 15254. Up to 1882 conditions per place. [2025-01-10 06:40:35,142 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 105 selfloop transitions, 81 changer transitions 10/197 dead transitions. [2025-01-10 06:40:35,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 197 transitions, 2314 flow [2025-01-10 06:40:35,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 06:40:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 06:40:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 207 transitions. [2025-01-10 06:40:35,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3382352941176471 [2025-01-10 06:40:35,144 INFO L175 Difference]: Start difference. First operand has 117 places, 134 transitions, 1514 flow. Second operand 18 states and 207 transitions. [2025-01-10 06:40:35,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 197 transitions, 2314 flow [2025-01-10 06:40:35,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 197 transitions, 2182 flow, removed 40 selfloop flow, removed 6 redundant places. [2025-01-10 06:40:35,190 INFO L231 Difference]: Finished difference. Result has 131 places, 138 transitions, 1661 flow [2025-01-10 06:40:35,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1661, PETRI_PLACES=131, PETRI_TRANSITIONS=138} [2025-01-10 06:40:35,191 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 96 predicate places. [2025-01-10 06:40:35,191 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 138 transitions, 1661 flow [2025-01-10 06:40:35,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:35,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:35,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:40:35,194 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:35,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:35,194 INFO L85 PathProgramCache]: Analyzing trace with hash 982595489, now seen corresponding path program 1 times [2025-01-10 06:40:35,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:35,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305455517] [2025-01-10 06:40:35,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:35,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:35,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:35,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:35,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:35,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:35,274 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:35,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:35,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305455517] [2025-01-10 06:40:35,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305455517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:35,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:35,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:40:35,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923031647] [2025-01-10 06:40:35,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:35,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:40:35,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:35,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:40:35,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:40:35,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-10 06:40:35,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 138 transitions, 1661 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:35,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-10 06:40:35,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:35,515 INFO L124 PetriNetUnfolderBase]: 836/1583 cut-off events. [2025-01-10 06:40:35,515 INFO L125 PetriNetUnfolderBase]: For 10489/10489 co-relation queries the response was YES. [2025-01-10 06:40:35,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7512 conditions, 1583 events. 836/1583 cut-off events. For 10489/10489 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10005 event pairs, 62 based on Foata normal form. 0/1503 useless extension candidates. Maximal degree in co-relation 6785. Up to 924 conditions per place. [2025-01-10 06:40:35,525 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 216 selfloop transitions, 7 changer transitions 6/229 dead transitions. [2025-01-10 06:40:35,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 229 transitions, 3264 flow [2025-01-10 06:40:35,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:40:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:40:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-01-10 06:40:35,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2025-01-10 06:40:35,528 INFO L175 Difference]: Start difference. First operand has 131 places, 138 transitions, 1661 flow. Second operand 4 states and 66 transitions. [2025-01-10 06:40:35,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 229 transitions, 3264 flow [2025-01-10 06:40:35,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 229 transitions, 3115 flow, removed 9 selfloop flow, removed 12 redundant places. [2025-01-10 06:40:35,548 INFO L231 Difference]: Finished difference. Result has 119 places, 95 transitions, 1019 flow [2025-01-10 06:40:35,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1019, PETRI_PLACES=119, PETRI_TRANSITIONS=95} [2025-01-10 06:40:35,549 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 84 predicate places. [2025-01-10 06:40:35,550 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 95 transitions, 1019 flow [2025-01-10 06:40:35,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:35,550 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:35,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:40:35,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:35,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1524550870, now seen corresponding path program 1 times [2025-01-10 06:40:35,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:35,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331819969] [2025-01-10 06:40:35,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:35,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:35,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:35,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:35,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:35,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:35,877 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:35,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:35,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331819969] [2025-01-10 06:40:35,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331819969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:35,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:35,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:35,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114171757] [2025-01-10 06:40:35,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:35,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:35,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:35,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:35,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:35,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:35,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 95 transitions, 1019 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:35,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:35,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:36,328 INFO L124 PetriNetUnfolderBase]: 700/1339 cut-off events. [2025-01-10 06:40:36,329 INFO L125 PetriNetUnfolderBase]: For 7784/7784 co-relation queries the response was YES. [2025-01-10 06:40:36,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6945 conditions, 1339 events. 700/1339 cut-off events. For 7784/7784 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7667 event pairs, 185 based on Foata normal form. 0/1251 useless extension candidates. Maximal degree in co-relation 6802. Up to 378 conditions per place. [2025-01-10 06:40:36,338 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 106 selfloop transitions, 39 changer transitions 0/145 dead transitions. [2025-01-10 06:40:36,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 145 transitions, 1558 flow [2025-01-10 06:40:36,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:40:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 06:40:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2025-01-10 06:40:36,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3582887700534759 [2025-01-10 06:40:36,339 INFO L175 Difference]: Start difference. First operand has 119 places, 95 transitions, 1019 flow. Second operand 11 states and 134 transitions. [2025-01-10 06:40:36,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 145 transitions, 1558 flow [2025-01-10 06:40:36,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 145 transitions, 1523 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:40:36,365 INFO L231 Difference]: Finished difference. Result has 130 places, 97 transitions, 1138 flow [2025-01-10 06:40:36,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1138, PETRI_PLACES=130, PETRI_TRANSITIONS=97} [2025-01-10 06:40:36,366 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 95 predicate places. [2025-01-10 06:40:36,366 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 97 transitions, 1138 flow [2025-01-10 06:40:36,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:36,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:36,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:40:36,368 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:36,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1749510291, now seen corresponding path program 1 times [2025-01-10 06:40:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:36,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533785235] [2025-01-10 06:40:36,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:36,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:36,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:36,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:36,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:36,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:36,736 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,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:36,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533785235] [2025-01-10 06:40:36,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533785235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:36,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:36,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:40:36,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213641938] [2025-01-10 06:40:36,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:36,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:40:36,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:36,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:40:36,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:40:36,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:36,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 97 transitions, 1138 flow. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:36,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:36,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:37,536 INFO L124 PetriNetUnfolderBase]: 716/1367 cut-off events. [2025-01-10 06:40:37,536 INFO L125 PetriNetUnfolderBase]: For 10270/10270 co-relation queries the response was YES. [2025-01-10 06:40:37,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7179 conditions, 1367 events. 716/1367 cut-off events. For 10270/10270 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7913 event pairs, 114 based on Foata normal form. 30/1349 useless extension candidates. Maximal degree in co-relation 7027. Up to 516 conditions per place. [2025-01-10 06:40:37,544 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 107 selfloop transitions, 70 changer transitions 22/199 dead transitions. [2025-01-10 06:40:37,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 199 transitions, 2020 flow [2025-01-10 06:40:37,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 06:40:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-10 06:40:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 272 transitions. [2025-01-10 06:40:37,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2025-01-10 06:40:37,546 INFO L175 Difference]: Start difference. First operand has 130 places, 97 transitions, 1138 flow. Second operand 28 states and 272 transitions. [2025-01-10 06:40:37,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 199 transitions, 2020 flow [2025-01-10 06:40:37,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 199 transitions, 1914 flow, removed 18 selfloop flow, removed 6 redundant places. [2025-01-10 06:40:37,576 INFO L231 Difference]: Finished difference. Result has 155 places, 104 transitions, 1298 flow [2025-01-10 06:40:37,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1298, PETRI_PLACES=155, PETRI_TRANSITIONS=104} [2025-01-10 06:40:37,578 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 120 predicate places. [2025-01-10 06:40:37,578 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 104 transitions, 1298 flow [2025-01-10 06:40:37,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:37,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:37,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:40:37,579 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:37,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:37,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1747636342, now seen corresponding path program 2 times [2025-01-10 06:40:37,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:37,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566783624] [2025-01-10 06:40:37,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:37,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:37,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:37,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:37,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:37,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:37,741 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:37,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:37,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566783624] [2025-01-10 06:40:37,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566783624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:37,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:37,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:40:37,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221696712] [2025-01-10 06:40:37,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:37,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:40:37,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:37,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:40:37,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:40:37,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:37,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 104 transitions, 1298 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:37,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:37,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:38,098 INFO L124 PetriNetUnfolderBase]: 730/1403 cut-off events. [2025-01-10 06:40:38,099 INFO L125 PetriNetUnfolderBase]: For 11437/11437 co-relation queries the response was YES. [2025-01-10 06:40:38,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7443 conditions, 1403 events. 730/1403 cut-off events. For 11437/11437 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8219 event pairs, 248 based on Foata normal form. 30/1369 useless extension candidates. Maximal degree in co-relation 7322. Up to 402 conditions per place. [2025-01-10 06:40:38,107 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 108 selfloop transitions, 24 changer transitions 14/146 dead transitions. [2025-01-10 06:40:38,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 146 transitions, 1812 flow [2025-01-10 06:40:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:40:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:40:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2025-01-10 06:40:38,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3790849673202614 [2025-01-10 06:40:38,111 INFO L175 Difference]: Start difference. First operand has 155 places, 104 transitions, 1298 flow. Second operand 9 states and 116 transitions. [2025-01-10 06:40:38,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 146 transitions, 1812 flow [2025-01-10 06:40:38,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 146 transitions, 1667 flow, removed 33 selfloop flow, removed 18 redundant places. [2025-01-10 06:40:38,140 INFO L231 Difference]: Finished difference. Result has 144 places, 94 transitions, 1120 flow [2025-01-10 06:40:38,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1120, PETRI_PLACES=144, PETRI_TRANSITIONS=94} [2025-01-10 06:40:38,142 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 109 predicate places. [2025-01-10 06:40:38,142 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 94 transitions, 1120 flow [2025-01-10 06:40:38,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:38,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:38,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:40:38,143 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:38,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:38,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1603530772, now seen corresponding path program 1 times [2025-01-10 06:40:38,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:38,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628621633] [2025-01-10 06:40:38,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:38,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:38,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:38,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:38,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:38,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:38,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:38,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628621633] [2025-01-10 06:40:38,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628621633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:38,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:38,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:40:38,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966093202] [2025-01-10 06:40:38,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:38,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:40:38,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:38,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:40:38,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:40:38,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:38,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 94 transitions, 1120 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:38,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:38,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:38,547 INFO L124 PetriNetUnfolderBase]: 594/1149 cut-off events. [2025-01-10 06:40:38,548 INFO L125 PetriNetUnfolderBase]: For 8861/8861 co-relation queries the response was YES. [2025-01-10 06:40:38,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6031 conditions, 1149 events. 594/1149 cut-off events. For 8861/8861 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6396 event pairs, 199 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 5933. Up to 444 conditions per place. [2025-01-10 06:40:38,554 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 101 selfloop transitions, 23 changer transitions 0/124 dead transitions. [2025-01-10 06:40:38,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 124 transitions, 1487 flow [2025-01-10 06:40:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:40:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:40:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2025-01-10 06:40:38,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-01-10 06:40:38,556 INFO L175 Difference]: Start difference. First operand has 144 places, 94 transitions, 1120 flow. Second operand 8 states and 102 transitions. [2025-01-10 06:40:38,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 124 transitions, 1487 flow [2025-01-10 06:40:38,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 124 transitions, 1382 flow, removed 27 selfloop flow, removed 11 redundant places. [2025-01-10 06:40:38,581 INFO L231 Difference]: Finished difference. Result has 139 places, 96 transitions, 1119 flow [2025-01-10 06:40:38,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1119, PETRI_PLACES=139, PETRI_TRANSITIONS=96} [2025-01-10 06:40:38,582 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 104 predicate places. [2025-01-10 06:40:38,583 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 96 transitions, 1119 flow [2025-01-10 06:40:38,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:38,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:38,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:40:38,583 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:38,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:38,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1603530771, now seen corresponding path program 1 times [2025-01-10 06:40:38,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:38,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242411274] [2025-01-10 06:40:38,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:38,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:38,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:38,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:38,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:38,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:38,866 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,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:38,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242411274] [2025-01-10 06:40:38,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242411274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:38,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:38,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:40:38,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908006470] [2025-01-10 06:40:38,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:38,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:40:38,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:38,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:40:38,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:40:38,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:38,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 96 transitions, 1119 flow. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:38,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:38,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:39,421 INFO L124 PetriNetUnfolderBase]: 592/1155 cut-off events. [2025-01-10 06:40:39,421 INFO L125 PetriNetUnfolderBase]: For 8881/8881 co-relation queries the response was YES. [2025-01-10 06:40:39,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5900 conditions, 1155 events. 592/1155 cut-off events. For 8881/8881 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6510 event pairs, 191 based on Foata normal form. 32/1187 useless extension candidates. Maximal degree in co-relation 5803. Up to 414 conditions per place. [2025-01-10 06:40:39,426 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 80 selfloop transitions, 38 changer transitions 36/154 dead transitions. [2025-01-10 06:40:39,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 154 transitions, 1699 flow [2025-01-10 06:40:39,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 06:40:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 06:40:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 198 transitions. [2025-01-10 06:40:39,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2911764705882353 [2025-01-10 06:40:39,429 INFO L175 Difference]: Start difference. First operand has 139 places, 96 transitions, 1119 flow. Second operand 20 states and 198 transitions. [2025-01-10 06:40:39,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 154 transitions, 1699 flow [2025-01-10 06:40:39,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 154 transitions, 1659 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-10 06:40:39,446 INFO L231 Difference]: Finished difference. Result has 156 places, 82 transitions, 980 flow [2025-01-10 06:40:39,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=980, PETRI_PLACES=156, PETRI_TRANSITIONS=82} [2025-01-10 06:40:39,447 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 121 predicate places. [2025-01-10 06:40:39,447 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 82 transitions, 980 flow [2025-01-10 06:40:39,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:39,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:39,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:40:39,447 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:39,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:39,448 INFO L85 PathProgramCache]: Analyzing trace with hash -551526517, now seen corresponding path program 2 times [2025-01-10 06:40:39,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:39,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509578250] [2025-01-10 06:40:39,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:39,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:39,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:39,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:39,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:39,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:39,733 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:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509578250] [2025-01-10 06:40:39,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509578250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:39,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:39,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:39,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421841507] [2025-01-10 06:40:39,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:39,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:39,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:39,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:39,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:39,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:39,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 82 transitions, 980 flow. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:39,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:39,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:40,138 INFO L124 PetriNetUnfolderBase]: 459/894 cut-off events. [2025-01-10 06:40:40,138 INFO L125 PetriNetUnfolderBase]: For 7009/7009 co-relation queries the response was YES. [2025-01-10 06:40:40,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4742 conditions, 894 events. 459/894 cut-off events. For 7009/7009 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4673 event pairs, 102 based on Foata normal form. 10/904 useless extension candidates. Maximal degree in co-relation 4663. Up to 390 conditions per place. [2025-01-10 06:40:40,143 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 50 selfloop transitions, 35 changer transitions 42/127 dead transitions. [2025-01-10 06:40:40,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 127 transitions, 1370 flow [2025-01-10 06:40:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 06:40:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 06:40:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 186 transitions. [2025-01-10 06:40:40,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2735294117647059 [2025-01-10 06:40:40,144 INFO L175 Difference]: Start difference. First operand has 156 places, 82 transitions, 980 flow. Second operand 20 states and 186 transitions. [2025-01-10 06:40:40,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 127 transitions, 1370 flow [2025-01-10 06:40:40,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 127 transitions, 1203 flow, removed 18 selfloop flow, removed 26 redundant places. [2025-01-10 06:40:40,157 INFO L231 Difference]: Finished difference. Result has 140 places, 65 transitions, 723 flow [2025-01-10 06:40:40,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=723, PETRI_PLACES=140, PETRI_TRANSITIONS=65} [2025-01-10 06:40:40,158 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 105 predicate places. [2025-01-10 06:40:40,158 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 65 transitions, 723 flow [2025-01-10 06:40:40,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:40,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:40,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:40:40,159 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:40,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:40,159 INFO L85 PathProgramCache]: Analyzing trace with hash -578070548, now seen corresponding path program 2 times [2025-01-10 06:40:40,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:40,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443436687] [2025-01-10 06:40:40,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:40,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:40,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:40,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:40,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:40,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:40,301 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,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:40,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443436687] [2025-01-10 06:40:40,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443436687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:40,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:40,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:40:40,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401948786] [2025-01-10 06:40:40,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:40,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:40:40,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:40,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:40:40,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:40:40,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:40,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 65 transitions, 723 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:40,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:40,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:40,522 INFO L124 PetriNetUnfolderBase]: 413/802 cut-off events. [2025-01-10 06:40:40,522 INFO L125 PetriNetUnfolderBase]: For 4568/4568 co-relation queries the response was YES. [2025-01-10 06:40:40,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3962 conditions, 802 events. 413/802 cut-off events. For 4568/4568 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4087 event pairs, 96 based on Foata normal form. 32/834 useless extension candidates. Maximal degree in co-relation 3914. Up to 340 conditions per place. [2025-01-10 06:40:40,527 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 67 selfloop transitions, 19 changer transitions 0/86 dead transitions. [2025-01-10 06:40:40,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 86 transitions, 973 flow [2025-01-10 06:40:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:40:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:40:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2025-01-10 06:40:40,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3403361344537815 [2025-01-10 06:40:40,528 INFO L175 Difference]: Start difference. First operand has 140 places, 65 transitions, 723 flow. Second operand 7 states and 81 transitions. [2025-01-10 06:40:40,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 86 transitions, 973 flow [2025-01-10 06:40:40,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 86 transitions, 866 flow, removed 10 selfloop flow, removed 19 redundant places. [2025-01-10 06:40:40,537 INFO L231 Difference]: Finished difference. Result has 112 places, 67 transitions, 706 flow [2025-01-10 06:40:40,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=706, PETRI_PLACES=112, PETRI_TRANSITIONS=67} [2025-01-10 06:40:40,538 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 77 predicate places. [2025-01-10 06:40:40,538 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 67 transitions, 706 flow [2025-01-10 06:40:40,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:40,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:40,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:40:40,538 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:40:40,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:40,539 INFO L85 PathProgramCache]: Analyzing trace with hash -310528147, now seen corresponding path program 2 times [2025-01-10 06:40:40,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:40,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522645944] [2025-01-10 06:40:40,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:40,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:40,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:40,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:40,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:40,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:40,931 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,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:40,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522645944] [2025-01-10 06:40:40,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522645944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:40,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:40,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:40:40,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744370114] [2025-01-10 06:40:40,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:40,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:40:40,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:40,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:40:40,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:40:40,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:40,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 67 transitions, 706 flow. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:40,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:40,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:41,500 INFO L124 PetriNetUnfolderBase]: 383/748 cut-off events. [2025-01-10 06:40:41,500 INFO L125 PetriNetUnfolderBase]: For 3563/3563 co-relation queries the response was YES. [2025-01-10 06:40:41,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3656 conditions, 748 events. 383/748 cut-off events. For 3563/3563 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3817 event pairs, 70 based on Foata normal form. 32/780 useless extension candidates. Maximal degree in co-relation 3614. Up to 254 conditions per place. [2025-01-10 06:40:41,503 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 74 selfloop transitions, 32 changer transitions 30/136 dead transitions. [2025-01-10 06:40:41,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 136 transitions, 1272 flow [2025-01-10 06:40:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-10 06:40:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-10 06:40:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 232 transitions. [2025-01-10 06:40:41,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26244343891402716 [2025-01-10 06:40:41,506 INFO L175 Difference]: Start difference. First operand has 112 places, 67 transitions, 706 flow. Second operand 26 states and 232 transitions. [2025-01-10 06:40:41,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 136 transitions, 1272 flow [2025-01-10 06:40:41,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 136 transitions, 1241 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-10 06:40:41,514 INFO L231 Difference]: Finished difference. Result has 136 places, 58 transitions, 604 flow [2025-01-10 06:40:41,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=604, PETRI_PLACES=136, PETRI_TRANSITIONS=58} [2025-01-10 06:40:41,514 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 101 predicate places. [2025-01-10 06:40:41,514 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 58 transitions, 604 flow [2025-01-10 06:40:41,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:41,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:41,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:40:41,515 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:41,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash -310528148, now seen corresponding path program 3 times [2025-01-10 06:40:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789131649] [2025-01-10 06:40:41,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:41,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:41,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:41,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:41,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:41,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:41,713 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:41,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:41,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789131649] [2025-01-10 06:40:41,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789131649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:41,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:41,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:41,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545678688] [2025-01-10 06:40:41,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:41,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:41,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:41,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:41,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:41,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:41,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 58 transitions, 604 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:41,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:41,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:41,984 INFO L124 PetriNetUnfolderBase]: 291/582 cut-off events. [2025-01-10 06:40:41,984 INFO L125 PetriNetUnfolderBase]: For 3086/3086 co-relation queries the response was YES. [2025-01-10 06:40:41,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2900 conditions, 582 events. 291/582 cut-off events. For 3086/3086 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2759 event pairs, 84 based on Foata normal form. 8/590 useless extension candidates. Maximal degree in co-relation 2853. Up to 244 conditions per place. [2025-01-10 06:40:41,988 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 58 selfloop transitions, 17 changer transitions 13/88 dead transitions. [2025-01-10 06:40:41,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 88 transitions, 888 flow [2025-01-10 06:40:41,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:40:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:40:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2025-01-10 06:40:41,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31470588235294117 [2025-01-10 06:40:41,990 INFO L175 Difference]: Start difference. First operand has 136 places, 58 transitions, 604 flow. Second operand 10 states and 107 transitions. [2025-01-10 06:40:41,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 88 transitions, 888 flow [2025-01-10 06:40:41,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 88 transitions, 726 flow, removed 19 selfloop flow, removed 30 redundant places. [2025-01-10 06:40:41,997 INFO L231 Difference]: Finished difference. Result has 108 places, 52 transitions, 435 flow [2025-01-10 06:40:41,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=435, PETRI_PLACES=108, PETRI_TRANSITIONS=52} [2025-01-10 06:40:41,997 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 73 predicate places. [2025-01-10 06:40:41,997 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 52 transitions, 435 flow [2025-01-10 06:40:41,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:41,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:41,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:40:41,998 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:41,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:41,999 INFO L85 PathProgramCache]: Analyzing trace with hash 941264484, now seen corresponding path program 3 times [2025-01-10 06:40:41,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:41,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113180889] [2025-01-10 06:40:41,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:41,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:42,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:42,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:42,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:42,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:42,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:42,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:42,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113180889] [2025-01-10 06:40:42,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113180889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:42,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:42,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:42,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828730084] [2025-01-10 06:40:42,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:42,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:42,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:42,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:42,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:42,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:42,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 52 transitions, 435 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:42,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:42,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:42,463 INFO L124 PetriNetUnfolderBase]: 204/419 cut-off events. [2025-01-10 06:40:42,463 INFO L125 PetriNetUnfolderBase]: For 1480/1480 co-relation queries the response was YES. [2025-01-10 06:40:42,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 419 events. 204/419 cut-off events. For 1480/1480 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1845 event pairs, 42 based on Foata normal form. 40/459 useless extension candidates. Maximal degree in co-relation 1842. Up to 186 conditions per place. [2025-01-10 06:40:42,465 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 45 selfloop transitions, 16 changer transitions 6/67 dead transitions. [2025-01-10 06:40:42,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 67 transitions, 603 flow [2025-01-10 06:40:42,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:40:42,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:40:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2025-01-10 06:40:42,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31932773109243695 [2025-01-10 06:40:42,466 INFO L175 Difference]: Start difference. First operand has 108 places, 52 transitions, 435 flow. Second operand 7 states and 76 transitions. [2025-01-10 06:40:42,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 67 transitions, 603 flow [2025-01-10 06:40:42,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 67 transitions, 525 flow, removed 4 selfloop flow, removed 13 redundant places. [2025-01-10 06:40:42,469 INFO L231 Difference]: Finished difference. Result has 89 places, 44 transitions, 308 flow [2025-01-10 06:40:42,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=308, PETRI_PLACES=89, PETRI_TRANSITIONS=44} [2025-01-10 06:40:42,470 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 54 predicate places. [2025-01-10 06:40:42,470 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 44 transitions, 308 flow [2025-01-10 06:40:42,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:42,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:42,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:40:42,470 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:42,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash 946713355, now seen corresponding path program 3 times [2025-01-10 06:40:42,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:42,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807775547] [2025-01-10 06:40:42,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:42,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:42,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:42,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:42,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:42,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:42,720 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,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:42,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807775547] [2025-01-10 06:40:42,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807775547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:42,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:42,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:42,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883656254] [2025-01-10 06:40:42,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:42,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:42,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:42,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:42,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:42,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:42,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 44 transitions, 308 flow. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:42,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:42,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:43,028 INFO L124 PetriNetUnfolderBase]: 126/263 cut-off events. [2025-01-10 06:40:43,028 INFO L125 PetriNetUnfolderBase]: For 732/732 co-relation queries the response was YES. [2025-01-10 06:40:43,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 263 events. 126/263 cut-off events. For 732/732 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 998 event pairs, 12 based on Foata normal form. 20/283 useless extension candidates. Maximal degree in co-relation 1125. Up to 54 conditions per place. [2025-01-10 06:40:43,029 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 24 selfloop transitions, 17 changer transitions 37/78 dead transitions. [2025-01-10 06:40:43,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 78 transitions, 592 flow [2025-01-10 06:40:43,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 06:40:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 06:40:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 133 transitions. [2025-01-10 06:40:43,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24448529411764705 [2025-01-10 06:40:43,030 INFO L175 Difference]: Start difference. First operand has 89 places, 44 transitions, 308 flow. Second operand 16 states and 133 transitions. [2025-01-10 06:40:43,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 78 transitions, 592 flow [2025-01-10 06:40:43,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 78 transitions, 512 flow, removed 4 selfloop flow, removed 10 redundant places. [2025-01-10 06:40:43,032 INFO L231 Difference]: Finished difference. Result has 83 places, 29 transitions, 180 flow [2025-01-10 06:40:43,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=180, PETRI_PLACES=83, PETRI_TRANSITIONS=29} [2025-01-10 06:40:43,032 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2025-01-10 06:40:43,032 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 29 transitions, 180 flow [2025-01-10 06:40:43,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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:43,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:43,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:43,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:40:43,033 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:43,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:43,033 INFO L85 PathProgramCache]: Analyzing trace with hash 946928395, now seen corresponding path program 3 times [2025-01-10 06:40:43,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:43,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996964166] [2025-01-10 06:40:43,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:43,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:43,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-01-10 06:40:43,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:43,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 06:40:43,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:43,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:43,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:43,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996964166] [2025-01-10 06:40:43,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996964166] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:40:43,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427100912] [2025-01-10 06:40:43,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:43,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:40:43,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:40:43,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:40:43,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:40:43,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-01-10 06:40:43,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:43,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 06:40:43,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:43,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 06:40:43,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:40:43,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-01-10 06:40:43,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-10 06:40:43,608 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-01-10 06:40:43,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 25 [2025-01-10 06:40:43,712 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-01-10 06:40:43,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 46 [2025-01-10 06:40:43,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 06:40:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:43,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:41:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:41:12,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427100912] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:41:12,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:41:12,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2025-01-10 06:41:12,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053617845] [2025-01-10 06:41:12,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:41:12,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-10 06:41:12,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:12,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-10 06:41:12,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=592, Unknown=7, NotChecked=0, Total=702 [2025-01-10 06:41:12,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:41:12,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 29 transitions, 180 flow. Second operand has 27 states, 27 states have (on average 5.481481481481482) internal successors, (148), 27 states have internal predecessors, (148), 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:12,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:12,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:41:12,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:13,661 INFO L124 PetriNetUnfolderBase]: 44/101 cut-off events. [2025-01-10 06:41:13,662 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-01-10 06:41:13,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 101 events. 44/101 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 255 event pairs, 0 based on Foata normal form. 8/109 useless extension candidates. Maximal degree in co-relation 418. Up to 16 conditions per place. [2025-01-10 06:41:13,662 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 0 selfloop transitions, 0 changer transitions 53/53 dead transitions. [2025-01-10 06:41:13,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 53 transitions, 388 flow [2025-01-10 06:41:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:41:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:41:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 119 transitions. [2025-01-10 06:41:13,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.20588235294117646 [2025-01-10 06:41:13,663 INFO L175 Difference]: Start difference. First operand has 83 places, 29 transitions, 180 flow. Second operand 17 states and 119 transitions. [2025-01-10 06:41:13,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 53 transitions, 388 flow [2025-01-10 06:41:13,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 300 flow, removed 2 selfloop flow, removed 19 redundant places. [2025-01-10 06:41:13,664 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2025-01-10 06:41:13,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2025-01-10 06:41:13,664 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2025-01-10 06:41:13,664 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 0 transitions, 0 flow [2025-01-10 06:41:13,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.481481481481482) internal successors, (148), 27 states have internal predecessors, (148), 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:13,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-01-10 06:41:13,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2025-01-10 06:41:13,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 06:41:13,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 06:41:13,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 06:41:13,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 06:41:13,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 06:41:13,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 06:41:13,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:41:13,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-10 06:41:13,869 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 3, 3, 3, 3, 1, 1, 1] [2025-01-10 06:41:13,873 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:41:13,873 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:41:13,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:41:13 BasicIcfg [2025-01-10 06:41:13,876 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:41:13,877 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:41:13,877 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:41:13,877 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:41:13,878 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:40:25" (3/4) ... [2025-01-10 06:41:13,879 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:41:13,880 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-01-10 06:41:13,885 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2025-01-10 06:41:13,885 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2025-01-10 06:41:13,885 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-10 06:41:13,886 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 06:41:13,957 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:41:13,957 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:41:13,957 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:41:13,958 INFO L158 Benchmark]: Toolchain (without parser) took 49476.46ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 111.1MB in the beginning and 415.9MB in the end (delta: -304.8MB). Peak memory consumption was 273.0MB. Max. memory is 16.1GB. [2025-01-10 06:41:13,959 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:41:13,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.00ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 80.4MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-10 06:41:13,959 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.18ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 78.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:41:13,960 INFO L158 Benchmark]: Boogie Preprocessor took 72.18ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 74.3MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:41:13,960 INFO L158 Benchmark]: RCFGBuilder took 601.77ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 95.5MB in the end (delta: -21.3MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2025-01-10 06:41:13,960 INFO L158 Benchmark]: TraceAbstraction took 48260.92ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 95.5MB in the beginning and 422.2MB in the end (delta: -326.6MB). Peak memory consumption was 256.8MB. Max. memory is 16.1GB. [2025-01-10 06:41:13,960 INFO L158 Benchmark]: Witness Printer took 80.54ms. Allocated memory is still 721.4MB. Free memory was 422.2MB in the beginning and 415.9MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:41:13,961 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.00ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 80.4MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.18ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 78.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.18ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 74.3MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 601.77ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 95.5MB in the end (delta: -21.3MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * TraceAbstraction took 48260.92ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 95.5MB in the beginning and 422.2MB in the end (delta: -326.6MB). Peak memory consumption was 256.8MB. Max. memory is 16.1GB. * Witness Printer took 80.54ms. Allocated memory is still 721.4MB. Free memory was 422.2MB in the beginning and 415.9MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3914]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 3914]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 42 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 48.2s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1618 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1617 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 257 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7104 IncrementalHoareTripleChecker+Invalid, 7361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 257 mSolverCounterUnsat, 0 mSDtfsCounter, 7104 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 32.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1661occurred in iteration=9, InterpolantAutomatonStates: 308, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 34.9s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 288 ConstructedInterpolants, 10 QuantifiedInterpolants, 3047 SizeOfPredicates, 14 NumberOfNonLiveVariables, 183 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:41:13,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE