./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-races/race-2_2-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-2_2-container_of.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:40:15,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:40:15,793 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:15,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:40:15,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:40:15,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:40:15,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:40:15,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:40:15,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:40:15,827 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:40:15,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:40:15,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:40:15,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:40:15,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:40:15,827 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:40:15,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:40:15,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:40:15,830 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:40:15,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:40:15,831 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:40:15,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:40:15,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:40:15,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:40:15,832 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:40:15,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:40:15,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:40:15,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:40:15,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:40:15,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:40:15,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:40:15,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:40:15,832 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 -> 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 [2025-01-10 06:40:16,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:40:16,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:40:16,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:40:16,034 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:40:16,034 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:40:16,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2025-01-10 06:40:17,380 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d851a6ae/d7361dce9b994e008ff4ca969d7dbf50/FLAG65235012c [2025-01-10 06:40:17,722 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:40:17,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2025-01-10 06:40:17,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d851a6ae/d7361dce9b994e008ff4ca969d7dbf50/FLAG65235012c [2025-01-10 06:40:17,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d851a6ae/d7361dce9b994e008ff4ca969d7dbf50 [2025-01-10 06:40:17,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:40:17,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:40:17,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:40:17,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:40:17,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:40:17,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:40:17" (1/1) ... [2025-01-10 06:40:17,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76488651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:17, skipping insertion in model container [2025-01-10 06:40:17,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:40:17" (1/1) ... [2025-01-10 06:40:17,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:40:18,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:40:18,140 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:40:18,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:40:18,236 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:40:18,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:18 WrapperNode [2025-01-10 06:40:18,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:40:18,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:40:18,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:40:18,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:40:18,250 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:18" (1/1) ... [2025-01-10 06:40:18,275 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:18" (1/1) ... [2025-01-10 06:40:18,297 INFO L138 Inliner]: procedures = 246, calls = 40, calls flagged for inlining = 11, calls inlined = 14, statements flattened = 120 [2025-01-10 06:40:18,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:40:18,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:40:18,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:40:18,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:40:18,307 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:18" (1/1) ... [2025-01-10 06:40:18,312 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:18" (1/1) ... [2025-01-10 06:40:18,314 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:18" (1/1) ... [2025-01-10 06:40:18,337 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 11, 2]. 73 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, 6, 2]. [2025-01-10 06:40:18,337 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:18" (1/1) ... [2025-01-10 06:40:18,341 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:18" (1/1) ... [2025-01-10 06:40:18,352 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:18" (1/1) ... [2025-01-10 06:40:18,357 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:18" (1/1) ... [2025-01-10 06:40:18,359 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:18" (1/1) ... [2025-01-10 06:40:18,361 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:18" (1/1) ... [2025-01-10 06:40:18,366 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:18" (1/1) ... [2025-01-10 06:40:18,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:40:18,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:40:18,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:40:18,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:40:18,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:18" (1/1) ... [2025-01-10 06:40:18,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:40:18,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:40:18,423 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:18,425 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:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-01-10 06:40:18,460 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-01-10 06:40:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:40:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:40:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:40:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:40:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:40:18,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:40:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:40:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:40:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:40:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:40:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:40:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:40:18,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:40:18,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:40:18,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:40:18,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:40:18,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:40:18,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:40:18,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:40:18,464 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:18,671 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:40:18,673 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:40:18,842 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:40:18,842 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:40:18,934 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:40:18,935 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:40:18,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:40:18 BoogieIcfgContainer [2025-01-10 06:40:18,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:40:18,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:40:18,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:40:18,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:40:18,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:40:17" (1/3) ... [2025-01-10 06:40:18,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@306b0dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:40:18, skipping insertion in model container [2025-01-10 06:40:18,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:40:18" (2/3) ... [2025-01-10 06:40:18,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@306b0dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:40:18, skipping insertion in model container [2025-01-10 06:40:18,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:40:18" (3/3) ... [2025-01-10 06:40:18,942 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2025-01-10 06:40:18,951 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:40:18,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_2-container_of.i that has 2 procedures, 24 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-10 06:40:18,953 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:40:18,990 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:40:19,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 34 transitions, 82 flow [2025-01-10 06:40:19,033 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2025-01-10 06:40:19,035 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:40:19,037 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 75 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:19,037 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 34 transitions, 82 flow [2025-01-10 06:40:19,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 65 flow [2025-01-10 06:40:19,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:40:19,053 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;@10283d03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:40:19,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 06:40:19,059 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:40:19,059 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-01-10 06:40:19,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:40:19,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:19,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:19,060 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:19,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:19,064 INFO L85 PathProgramCache]: Analyzing trace with hash -183419474, now seen corresponding path program 1 times [2025-01-10 06:40:19,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:19,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11467821] [2025-01-10 06:40:19,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:19,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:19,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:40:19,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:40:19,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:19,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:19,833 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:19,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:19,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11467821] [2025-01-10 06:40:19,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11467821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:19,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:19,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:40:19,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062446486] [2025-01-10 06:40:19,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:19,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:40:19,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:19,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:40:19,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:40:19,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:19,867 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:19,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:19,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:19,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:20,360 INFO L124 PetriNetUnfolderBase]: 769/1306 cut-off events. [2025-01-10 06:40:20,361 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-10 06:40:20,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2638 conditions, 1306 events. 769/1306 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6470 event pairs, 347 based on Foata normal form. 0/1086 useless extension candidates. Maximal degree in co-relation 2568. Up to 850 conditions per place. [2025-01-10 06:40:20,382 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 63 selfloop transitions, 20 changer transitions 2/86 dead transitions. [2025-01-10 06:40:20,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 86 transitions, 366 flow [2025-01-10 06:40:20,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:40:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:40:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2025-01-10 06:40:20,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37941176470588234 [2025-01-10 06:40:20,400 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:20,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 86 transitions, 366 flow [2025-01-10 06:40:20,412 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:20,415 INFO L231 Difference]: Finished difference. Result has 46 places, 48 transitions, 188 flow [2025-01-10 06:40:20,420 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:20,426 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2025-01-10 06:40:20,427 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 48 transitions, 188 flow [2025-01-10 06:40:20,427 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:20,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:20,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:20,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:40:20,428 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:20,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:20,432 INFO L85 PathProgramCache]: Analyzing trace with hash -186141248, now seen corresponding path program 1 times [2025-01-10 06:40:20,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:20,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105828936] [2025-01-10 06:40:20,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:20,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:20,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:40:20,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:40:20,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:20,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:20,913 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:20,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:20,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105828936] [2025-01-10 06:40:20,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105828936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:20,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:20,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:40:20,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408993935] [2025-01-10 06:40:20,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:20,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:40:20,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:20,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:40:20,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:40:20,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:20,917 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:20,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:20,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:20,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:21,382 INFO L124 PetriNetUnfolderBase]: 899/1554 cut-off events. [2025-01-10 06:40:21,385 INFO L125 PetriNetUnfolderBase]: For 794/794 co-relation queries the response was YES. [2025-01-10 06:40:21,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 1554 events. 899/1554 cut-off events. For 794/794 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 8213 event pairs, 631 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 2189. Up to 1126 conditions per place. [2025-01-10 06:40:21,403 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 64 selfloop transitions, 27 changer transitions 4/96 dead transitions. [2025-01-10 06:40:21,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 96 transitions, 550 flow [2025-01-10 06:40:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:40:21,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:40:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-01-10 06:40:21,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2025-01-10 06:40:21,409 INFO L175 Difference]: Start difference. First operand has 46 places, 48 transitions, 188 flow. Second operand 10 states and 125 transitions. [2025-01-10 06:40:21,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 96 transitions, 550 flow [2025-01-10 06:40:21,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 96 transitions, 548 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:40:21,419 INFO L231 Difference]: Finished difference. Result has 58 places, 64 transitions, 344 flow [2025-01-10 06:40:21,419 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=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=344, PETRI_PLACES=58, PETRI_TRANSITIONS=64} [2025-01-10 06:40:21,419 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2025-01-10 06:40:21,420 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 64 transitions, 344 flow [2025-01-10 06:40:21,420 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:21,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:21,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:21,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:40:21,420 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:21,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:21,421 INFO L85 PathProgramCache]: Analyzing trace with hash -3978691, now seen corresponding path program 1 times [2025-01-10 06:40:21,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:21,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599125194] [2025-01-10 06:40:21,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:21,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:21,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:21,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:40:21,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:21,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:22,168 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:22,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:22,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599125194] [2025-01-10 06:40:22,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599125194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:22,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:22,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:22,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062320178] [2025-01-10 06:40:22,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:22,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:22,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:22,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:22,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:22,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:22,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 64 transitions, 344 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:22,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:22,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:22,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:23,379 INFO L124 PetriNetUnfolderBase]: 1410/2455 cut-off events. [2025-01-10 06:40:23,380 INFO L125 PetriNetUnfolderBase]: For 2390/2394 co-relation queries the response was YES. [2025-01-10 06:40:23,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7340 conditions, 2455 events. 1410/2455 cut-off events. For 2390/2394 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 14577 event pairs, 653 based on Foata normal form. 54/2347 useless extension candidates. Maximal degree in co-relation 4394. Up to 1397 conditions per place. [2025-01-10 06:40:23,389 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 121 selfloop transitions, 66 changer transitions 4/192 dead transitions. [2025-01-10 06:40:23,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 192 transitions, 1364 flow [2025-01-10 06:40:23,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:40:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:40:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 202 transitions. [2025-01-10 06:40:23,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3494809688581315 [2025-01-10 06:40:23,391 INFO L175 Difference]: Start difference. First operand has 58 places, 64 transitions, 344 flow. Second operand 17 states and 202 transitions. [2025-01-10 06:40:23,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 192 transitions, 1364 flow [2025-01-10 06:40:23,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 192 transitions, 1364 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:40:23,400 INFO L231 Difference]: Finished difference. Result has 86 places, 123 transitions, 983 flow [2025-01-10 06:40:23,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=983, PETRI_PLACES=86, PETRI_TRANSITIONS=123} [2025-01-10 06:40:23,401 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2025-01-10 06:40:23,401 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 123 transitions, 983 flow [2025-01-10 06:40:23,401 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:23,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:23,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:23,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:40:23,402 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:23,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash -859285121, now seen corresponding path program 1 times [2025-01-10 06:40:23,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:23,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844956010] [2025-01-10 06:40:23,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:23,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:23,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:23,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:40:23,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:23,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:23,867 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:23,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:23,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844956010] [2025-01-10 06:40:23,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844956010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:23,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:23,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700874789] [2025-01-10 06:40:23,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:23,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:23,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:23,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:23,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:23,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:23,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 123 transitions, 983 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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:23,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:23,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:23,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:24,423 INFO L124 PetriNetUnfolderBase]: 1416/2509 cut-off events. [2025-01-10 06:40:24,423 INFO L125 PetriNetUnfolderBase]: For 6890/6904 co-relation queries the response was YES. [2025-01-10 06:40:24,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9596 conditions, 2509 events. 1416/2509 cut-off events. For 6890/6904 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15284 event pairs, 592 based on Foata normal form. 68/2401 useless extension candidates. Maximal degree in co-relation 8877. Up to 1610 conditions per place. [2025-01-10 06:40:24,439 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 112 selfloop transitions, 90 changer transitions 19/222 dead transitions. [2025-01-10 06:40:24,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 222 transitions, 2146 flow [2025-01-10 06:40:24,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:40:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:40:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 167 transitions. [2025-01-10 06:40:24,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35084033613445376 [2025-01-10 06:40:24,441 INFO L175 Difference]: Start difference. First operand has 86 places, 123 transitions, 983 flow. Second operand 14 states and 167 transitions. [2025-01-10 06:40:24,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 222 transitions, 2146 flow [2025-01-10 06:40:24,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 222 transitions, 2040 flow, removed 45 selfloop flow, removed 3 redundant places. [2025-01-10 06:40:24,469 INFO L231 Difference]: Finished difference. Result has 104 places, 159 transitions, 1605 flow [2025-01-10 06:40:24,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1605, PETRI_PLACES=104, PETRI_TRANSITIONS=159} [2025-01-10 06:40:24,470 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 69 predicate places. [2025-01-10 06:40:24,470 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 159 transitions, 1605 flow [2025-01-10 06:40:24,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:40:24,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:24,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:24,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:40:24,471 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:24,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:24,471 INFO L85 PathProgramCache]: Analyzing trace with hash -415995041, now seen corresponding path program 2 times [2025-01-10 06:40:24,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620570482] [2025-01-10 06:40:24,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:24,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:24,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:24,490 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:24,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:24,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:24,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:24,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620570482] [2025-01-10 06:40:24,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620570482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:24,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:24,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997693223] [2025-01-10 06:40:24,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:24,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:24,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:24,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:24,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:24,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:24,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 159 transitions, 1605 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:24,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:24,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:24,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:25,667 INFO L124 PetriNetUnfolderBase]: 1564/2782 cut-off events. [2025-01-10 06:40:25,667 INFO L125 PetriNetUnfolderBase]: For 9431/9449 co-relation queries the response was YES. [2025-01-10 06:40:25,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11526 conditions, 2782 events. 1564/2782 cut-off events. For 9431/9449 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 17451 event pairs, 616 based on Foata normal form. 72/2664 useless extension candidates. Maximal degree in co-relation 10753. Up to 1607 conditions per place. [2025-01-10 06:40:25,685 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 106 selfloop transitions, 124 changer transitions 19/250 dead transitions. [2025-01-10 06:40:25,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 250 transitions, 2816 flow [2025-01-10 06:40:25,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 06:40:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 06:40:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 201 transitions. [2025-01-10 06:40:25,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3284313725490196 [2025-01-10 06:40:25,687 INFO L175 Difference]: Start difference. First operand has 104 places, 159 transitions, 1605 flow. Second operand 18 states and 201 transitions. [2025-01-10 06:40:25,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 250 transitions, 2816 flow [2025-01-10 06:40:25,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 250 transitions, 2751 flow, removed 25 selfloop flow, removed 3 redundant places. [2025-01-10 06:40:25,722 INFO L231 Difference]: Finished difference. Result has 123 places, 185 transitions, 2198 flow [2025-01-10 06:40:25,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2198, PETRI_PLACES=123, PETRI_TRANSITIONS=185} [2025-01-10 06:40:25,722 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 88 predicate places. [2025-01-10 06:40:25,723 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 185 transitions, 2198 flow [2025-01-10 06:40:25,723 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:25,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:25,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:25,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:40:25,723 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:25,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:25,724 INFO L85 PathProgramCache]: Analyzing trace with hash -410632661, now seen corresponding path program 3 times [2025-01-10 06:40:25,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:25,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160452039] [2025-01-10 06:40:25,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:25,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:25,740 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:25,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:25,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:26,052 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,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:26,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160452039] [2025-01-10 06:40:26,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160452039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:26,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:26,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:26,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202095824] [2025-01-10 06:40:26,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:26,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:26,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:26,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:26,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:26,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:26,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 185 transitions, 2198 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:26,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:26,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:26,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:27,278 INFO L124 PetriNetUnfolderBase]: 1729/3110 cut-off events. [2025-01-10 06:40:27,278 INFO L125 PetriNetUnfolderBase]: For 11792/11796 co-relation queries the response was YES. [2025-01-10 06:40:27,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13248 conditions, 3110 events. 1729/3110 cut-off events. For 11792/11796 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 20222 event pairs, 849 based on Foata normal form. 56/2960 useless extension candidates. Maximal degree in co-relation 12848. Up to 1870 conditions per place. [2025-01-10 06:40:27,331 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 105 selfloop transitions, 109 changer transitions 13/228 dead transitions. [2025-01-10 06:40:27,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 228 transitions, 2954 flow [2025-01-10 06:40:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:40:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:40:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 150 transitions. [2025-01-10 06:40:27,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2025-01-10 06:40:27,336 INFO L175 Difference]: Start difference. First operand has 123 places, 185 transitions, 2198 flow. Second operand 12 states and 150 transitions. [2025-01-10 06:40:27,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 228 transitions, 2954 flow [2025-01-10 06:40:27,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 228 transitions, 2847 flow, removed 34 selfloop flow, removed 7 redundant places. [2025-01-10 06:40:27,397 INFO L231 Difference]: Finished difference. Result has 130 places, 188 transitions, 2427 flow [2025-01-10 06:40:27,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2427, PETRI_PLACES=130, PETRI_TRANSITIONS=188} [2025-01-10 06:40:27,399 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 95 predicate places. [2025-01-10 06:40:27,399 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 188 transitions, 2427 flow [2025-01-10 06:40:27,399 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:27,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:27,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:27,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:40:27,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:27,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:27,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1299970082, now seen corresponding path program 1 times [2025-01-10 06:40:27,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:27,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11398383] [2025-01-10 06:40:27,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:27,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:27,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:27,420 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,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:27,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:27,816 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,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:27,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11398383] [2025-01-10 06:40:27,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11398383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:27,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:27,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:27,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18412238] [2025-01-10 06:40:27,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:27,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:27,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:27,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:27,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:27,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:27,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 188 transitions, 2427 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:27,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:27,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:27,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:28,519 INFO L124 PetriNetUnfolderBase]: 1967/3514 cut-off events. [2025-01-10 06:40:28,519 INFO L125 PetriNetUnfolderBase]: For 15345/15355 co-relation queries the response was YES. [2025-01-10 06:40:28,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15298 conditions, 3514 events. 1967/3514 cut-off events. For 15345/15355 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 23216 event pairs, 947 based on Foata normal form. 82/3368 useless extension candidates. Maximal degree in co-relation 14986. Up to 2269 conditions per place. [2025-01-10 06:40:28,541 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 173 selfloop transitions, 87 changer transitions 12/273 dead transitions. [2025-01-10 06:40:28,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 273 transitions, 3597 flow [2025-01-10 06:40:28,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:40:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:40:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 178 transitions. [2025-01-10 06:40:28,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34901960784313724 [2025-01-10 06:40:28,543 INFO L175 Difference]: Start difference. First operand has 130 places, 188 transitions, 2427 flow. Second operand 15 states and 178 transitions. [2025-01-10 06:40:28,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 273 transitions, 3597 flow [2025-01-10 06:40:28,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 273 transitions, 3410 flow, removed 35 selfloop flow, removed 6 redundant places. [2025-01-10 06:40:28,592 INFO L231 Difference]: Finished difference. Result has 142 places, 211 transitions, 2752 flow [2025-01-10 06:40:28,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2266, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2752, PETRI_PLACES=142, PETRI_TRANSITIONS=211} [2025-01-10 06:40:28,593 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 107 predicate places. [2025-01-10 06:40:28,594 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 211 transitions, 2752 flow [2025-01-10 06:40:28,594 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,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:28,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:28,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:40:28,595 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:28,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1506623297, now seen corresponding path program 2 times [2025-01-10 06:40:28,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:28,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491500160] [2025-01-10 06:40:28,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:28,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:28,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:28,617 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:28,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:28,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:28,842 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,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:28,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491500160] [2025-01-10 06:40:28,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491500160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:28,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:28,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:28,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332118465] [2025-01-10 06:40:28,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:28,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:28,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:28,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:28,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:28,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:28,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 211 transitions, 2752 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,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:28,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:28,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:29,607 INFO L124 PetriNetUnfolderBase]: 2198/3934 cut-off events. [2025-01-10 06:40:29,608 INFO L125 PetriNetUnfolderBase]: For 21412/21414 co-relation queries the response was YES. [2025-01-10 06:40:29,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18649 conditions, 3934 events. 2198/3934 cut-off events. For 21412/21414 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 26611 event pairs, 978 based on Foata normal form. 56/3738 useless extension candidates. Maximal degree in co-relation 17908. Up to 2459 conditions per place. [2025-01-10 06:40:29,632 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 144 selfloop transitions, 140 changer transitions 8/293 dead transitions. [2025-01-10 06:40:29,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 293 transitions, 4120 flow [2025-01-10 06:40:29,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 06:40:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 06:40:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 199 transitions. [2025-01-10 06:40:29,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32516339869281047 [2025-01-10 06:40:29,634 INFO L175 Difference]: Start difference. First operand has 142 places, 211 transitions, 2752 flow. Second operand 18 states and 199 transitions. [2025-01-10 06:40:29,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 293 transitions, 4120 flow [2025-01-10 06:40:29,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 293 transitions, 4030 flow, removed 11 selfloop flow, removed 9 redundant places. [2025-01-10 06:40:29,704 INFO L231 Difference]: Finished difference. Result has 155 places, 232 transitions, 3404 flow [2025-01-10 06:40:29,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2670, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3404, PETRI_PLACES=155, PETRI_TRANSITIONS=232} [2025-01-10 06:40:29,704 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 120 predicate places. [2025-01-10 06:40:29,705 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 232 transitions, 3404 flow [2025-01-10 06:40:29,705 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,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:29,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:29,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:40:29,705 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:29,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:29,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1506623522, now seen corresponding path program 2 times [2025-01-10 06:40:29,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:29,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259190049] [2025-01-10 06:40:29,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:29,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:29,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:29,720 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,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:29,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:29,979 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,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259190049] [2025-01-10 06:40:29,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259190049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:29,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:29,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:29,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251120144] [2025-01-10 06:40:29,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:29,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:29,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:29,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:29,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:29,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:29,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 232 transitions, 3404 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,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:29,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:29,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:30,911 INFO L124 PetriNetUnfolderBase]: 2509/4501 cut-off events. [2025-01-10 06:40:30,911 INFO L125 PetriNetUnfolderBase]: For 34764/34766 co-relation queries the response was YES. [2025-01-10 06:40:30,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24088 conditions, 4501 events. 2509/4501 cut-off events. For 34764/34766 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 31285 event pairs, 1240 based on Foata normal form. 96/4327 useless extension candidates. Maximal degree in co-relation 22950. Up to 2931 conditions per place. [2025-01-10 06:40:30,939 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 225 selfloop transitions, 95 changer transitions 15/336 dead transitions. [2025-01-10 06:40:30,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 336 transitions, 5256 flow [2025-01-10 06:40:30,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:40:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:40:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 174 transitions. [2025-01-10 06:40:30,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3411764705882353 [2025-01-10 06:40:30,942 INFO L175 Difference]: Start difference. First operand has 155 places, 232 transitions, 3404 flow. Second operand 15 states and 174 transitions. [2025-01-10 06:40:30,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 336 transitions, 5256 flow [2025-01-10 06:40:31,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 336 transitions, 5094 flow, removed 41 selfloop flow, removed 7 redundant places. [2025-01-10 06:40:31,070 INFO L231 Difference]: Finished difference. Result has 167 places, 265 transitions, 4151 flow [2025-01-10 06:40:31,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3293, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4151, PETRI_PLACES=167, PETRI_TRANSITIONS=265} [2025-01-10 06:40:31,071 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 132 predicate places. [2025-01-10 06:40:31,071 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 265 transitions, 4151 flow [2025-01-10 06:40:31,072 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,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:31,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:31,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:40:31,072 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:31,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1299969857, now seen corresponding path program 3 times [2025-01-10 06:40:31,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:31,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069202866] [2025-01-10 06:40:31,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:31,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:31,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:31,090 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,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:31,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:31,332 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,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:31,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069202866] [2025-01-10 06:40:31,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069202866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:31,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:31,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:31,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540853280] [2025-01-10 06:40:31,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:31,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:31,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:31,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:31,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:31,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:31,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 265 transitions, 4151 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,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:31,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:31,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:32,320 INFO L124 PetriNetUnfolderBase]: 2455/4453 cut-off events. [2025-01-10 06:40:32,321 INFO L125 PetriNetUnfolderBase]: For 41550/41554 co-relation queries the response was YES. [2025-01-10 06:40:32,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25392 conditions, 4453 events. 2455/4453 cut-off events. For 41550/41554 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 31241 event pairs, 1236 based on Foata normal form. 80/4283 useless extension candidates. Maximal degree in co-relation 24135. Up to 2769 conditions per place. [2025-01-10 06:40:32,411 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 211 selfloop transitions, 145 changer transitions 11/368 dead transitions. [2025-01-10 06:40:32,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 368 transitions, 6058 flow [2025-01-10 06:40:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 06:40:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-10 06:40:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 224 transitions. [2025-01-10 06:40:32,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32941176470588235 [2025-01-10 06:40:32,418 INFO L175 Difference]: Start difference. First operand has 167 places, 265 transitions, 4151 flow. Second operand 20 states and 224 transitions. [2025-01-10 06:40:32,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 368 transitions, 6058 flow [2025-01-10 06:40:32,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 368 transitions, 5907 flow, removed 40 selfloop flow, removed 5 redundant places. [2025-01-10 06:40:32,542 INFO L231 Difference]: Finished difference. Result has 186 places, 294 transitions, 4962 flow [2025-01-10 06:40:32,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4020, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4962, PETRI_PLACES=186, PETRI_TRANSITIONS=294} [2025-01-10 06:40:32,544 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 151 predicate places. [2025-01-10 06:40:32,544 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 294 transitions, 4962 flow [2025-01-10 06:40:32,544 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,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:32,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:32,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:40:32,544 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:32,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:32,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1305332462, now seen corresponding path program 3 times [2025-01-10 06:40:32,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:32,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165929929] [2025-01-10 06:40:32,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:32,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:32,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:40:32,558 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:32,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:32,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:32,822 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,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:32,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165929929] [2025-01-10 06:40:32,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165929929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:32,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:32,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113418031] [2025-01-10 06:40:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:32,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:32,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:32,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:32,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:32,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 294 transitions, 4962 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,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:32,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:32,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:34,122 INFO L124 PetriNetUnfolderBase]: 2422/4444 cut-off events. [2025-01-10 06:40:34,122 INFO L125 PetriNetUnfolderBase]: For 51080/51082 co-relation queries the response was YES. [2025-01-10 06:40:34,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26904 conditions, 4444 events. 2422/4444 cut-off events. For 51080/51082 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 31674 event pairs, 1270 based on Foata normal form. 72/4274 useless extension candidates. Maximal degree in co-relation 25641. Up to 2758 conditions per place. [2025-01-10 06:40:34,160 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 203 selfloop transitions, 148 changer transitions 15/367 dead transitions. [2025-01-10 06:40:34,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 367 transitions, 6354 flow [2025-01-10 06:40:34,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 06:40:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 06:40:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 210 transitions. [2025-01-10 06:40:34,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32507739938080493 [2025-01-10 06:40:34,165 INFO L175 Difference]: Start difference. First operand has 186 places, 294 transitions, 4962 flow. Second operand 19 states and 210 transitions. [2025-01-10 06:40:34,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 367 transitions, 6354 flow [2025-01-10 06:40:34,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 367 transitions, 6020 flow, removed 56 selfloop flow, removed 13 redundant places. [2025-01-10 06:40:34,335 INFO L231 Difference]: Finished difference. Result has 196 places, 301 transitions, 5218 flow [2025-01-10 06:40:34,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4667, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5218, PETRI_PLACES=196, PETRI_TRANSITIONS=301} [2025-01-10 06:40:34,335 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 161 predicate places. [2025-01-10 06:40:34,336 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 301 transitions, 5218 flow [2025-01-10 06:40:34,336 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,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:34,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:34,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:40:34,336 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:34,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:34,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1499473457, now seen corresponding path program 4 times [2025-01-10 06:40:34,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:34,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011954137] [2025-01-10 06:40:34,336 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:40:34,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:34,346 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 12 statements into 2 equivalence classes. [2025-01-10 06:40:34,350 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:34,350 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:40:34,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:34,621 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,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:34,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011954137] [2025-01-10 06:40:34,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011954137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:34,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:34,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 06:40:34,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401008511] [2025-01-10 06:40:34,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:34,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:40:34,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:34,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:40:34,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:40:34,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:34,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 301 transitions, 5218 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,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:34,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:34,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:35,831 INFO L124 PetriNetUnfolderBase]: 2350/4338 cut-off events. [2025-01-10 06:40:35,832 INFO L125 PetriNetUnfolderBase]: For 49537/49537 co-relation queries the response was YES. [2025-01-10 06:40:35,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26293 conditions, 4338 events. 2350/4338 cut-off events. For 49537/49537 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 30806 event pairs, 1203 based on Foata normal form. 52/4154 useless extension candidates. Maximal degree in co-relation 25363. Up to 2587 conditions per place. [2025-01-10 06:40:35,860 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 168 selfloop transitions, 194 changer transitions 10/373 dead transitions. [2025-01-10 06:40:35,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 373 transitions, 6644 flow [2025-01-10 06:40:35,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:40:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:40:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 231 transitions. [2025-01-10 06:40:35,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3088235294117647 [2025-01-10 06:40:35,862 INFO L175 Difference]: Start difference. First operand has 196 places, 301 transitions, 5218 flow. Second operand 22 states and 231 transitions. [2025-01-10 06:40:35,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 373 transitions, 6644 flow [2025-01-10 06:40:36,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 373 transitions, 6328 flow, removed 52 selfloop flow, removed 13 redundant places. [2025-01-10 06:40:36,006 INFO L231 Difference]: Finished difference. Result has 207 places, 307 transitions, 5500 flow [2025-01-10 06:40:36,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4936, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5500, PETRI_PLACES=207, PETRI_TRANSITIONS=307} [2025-01-10 06:40:36,007 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 172 predicate places. [2025-01-10 06:40:36,007 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 307 transitions, 5500 flow [2025-01-10 06:40:36,007 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:36,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:36,007 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,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:40:36,008 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:36,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:36,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1615928707, now seen corresponding path program 1 times [2025-01-10 06:40:36,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:36,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415603962] [2025-01-10 06:40:36,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:36,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:36,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:36,025 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,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:36,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:36,325 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,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:36,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415603962] [2025-01-10 06:40:36,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415603962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:36,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:36,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:36,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325882611] [2025-01-10 06:40:36,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:36,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:36,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:36,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:36,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:36,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:36,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 307 transitions, 5500 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:36,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:36,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:36,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:37,311 INFO L124 PetriNetUnfolderBase]: 2300/4297 cut-off events. [2025-01-10 06:40:37,312 INFO L125 PetriNetUnfolderBase]: For 52440/52440 co-relation queries the response was YES. [2025-01-10 06:40:37,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26503 conditions, 4297 events. 2300/4297 cut-off events. For 52440/52440 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 30659 event pairs, 800 based on Foata normal form. 0/4091 useless extension candidates. Maximal degree in co-relation 25905. Up to 2038 conditions per place. [2025-01-10 06:40:37,347 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 243 selfloop transitions, 178 changer transitions 20/442 dead transitions. [2025-01-10 06:40:37,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 442 transitions, 7721 flow [2025-01-10 06:40:37,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:40:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:40:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 234 transitions. [2025-01-10 06:40:37,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31283422459893045 [2025-01-10 06:40:37,351 INFO L175 Difference]: Start difference. First operand has 207 places, 307 transitions, 5500 flow. Second operand 22 states and 234 transitions. [2025-01-10 06:40:37,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 442 transitions, 7721 flow [2025-01-10 06:40:37,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 442 transitions, 7380 flow, removed 29 selfloop flow, removed 14 redundant places. [2025-01-10 06:40:37,544 INFO L231 Difference]: Finished difference. Result has 220 places, 354 transitions, 6317 flow [2025-01-10 06:40:37,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5181, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=6317, PETRI_PLACES=220, PETRI_TRANSITIONS=354} [2025-01-10 06:40:37,545 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 185 predicate places. [2025-01-10 06:40:37,545 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 354 transitions, 6317 flow [2025-01-10 06:40:37,545 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:37,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:37,546 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,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:40:37,546 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:37,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:37,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1615928708, now seen corresponding path program 1 times [2025-01-10 06:40:37,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:37,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708611245] [2025-01-10 06:40:37,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:37,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:37,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:37,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:37,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:37,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:38,190 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,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:38,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708611245] [2025-01-10 06:40:38,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708611245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:38,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:38,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:38,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788357522] [2025-01-10 06:40:38,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:38,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:38,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:38,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:38,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:38,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:38,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 354 transitions, 6317 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:38,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:38,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:38,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:39,105 INFO L124 PetriNetUnfolderBase]: 1826/3479 cut-off events. [2025-01-10 06:40:39,105 INFO L125 PetriNetUnfolderBase]: For 61327/61329 co-relation queries the response was YES. [2025-01-10 06:40:39,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23887 conditions, 3479 events. 1826/3479 cut-off events. For 61327/61329 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 24723 event pairs, 847 based on Foata normal form. 14/3367 useless extension candidates. Maximal degree in co-relation 23285. Up to 2924 conditions per place. [2025-01-10 06:40:39,135 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 312 selfloop transitions, 77 changer transitions 16/406 dead transitions. [2025-01-10 06:40:39,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 406 transitions, 7437 flow [2025-01-10 06:40:39,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:40:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:40:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 160 transitions. [2025-01-10 06:40:39,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3137254901960784 [2025-01-10 06:40:39,140 INFO L175 Difference]: Start difference. First operand has 220 places, 354 transitions, 6317 flow. Second operand 15 states and 160 transitions. [2025-01-10 06:40:39,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 406 transitions, 7437 flow [2025-01-10 06:40:39,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 406 transitions, 7263 flow, removed 44 selfloop flow, removed 8 redundant places. [2025-01-10 06:40:39,364 INFO L231 Difference]: Finished difference. Result has 233 places, 361 transitions, 6415 flow [2025-01-10 06:40:39,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=6165, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6415, PETRI_PLACES=233, PETRI_TRANSITIONS=361} [2025-01-10 06:40:39,366 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 198 predicate places. [2025-01-10 06:40:39,366 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 361 transitions, 6415 flow [2025-01-10 06:40:39,366 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:39,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:39,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:39,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:40:39,367 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:39,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:39,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1283461148, now seen corresponding path program 2 times [2025-01-10 06:40:39,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:39,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757050193] [2025-01-10 06:40:39,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:39,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:39,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:39,379 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,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:39,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:39,703 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,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:39,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757050193] [2025-01-10 06:40:39,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757050193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:39,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:39,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:39,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096321013] [2025-01-10 06:40:39,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:39,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:39,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:39,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:39,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:39,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:39,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 361 transitions, 6415 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,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:39,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:39,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:40,722 INFO L124 PetriNetUnfolderBase]: 2082/3988 cut-off events. [2025-01-10 06:40:40,723 INFO L125 PetriNetUnfolderBase]: For 77206/77208 co-relation queries the response was YES. [2025-01-10 06:40:40,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26891 conditions, 3988 events. 2082/3988 cut-off events. For 77206/77208 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 29265 event pairs, 887 based on Foata normal form. 28/3890 useless extension candidates. Maximal degree in co-relation 26285. Up to 2918 conditions per place. [2025-01-10 06:40:40,764 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 370 selfloop transitions, 95 changer transitions 8/474 dead transitions. [2025-01-10 06:40:40,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 474 transitions, 8576 flow [2025-01-10 06:40:40,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 06:40:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 06:40:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 217 transitions. [2025-01-10 06:40:40,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33591331269349844 [2025-01-10 06:40:40,765 INFO L175 Difference]: Start difference. First operand has 233 places, 361 transitions, 6415 flow. Second operand 19 states and 217 transitions. [2025-01-10 06:40:40,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 474 transitions, 8576 flow [2025-01-10 06:40:41,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 474 transitions, 8384 flow, removed 54 selfloop flow, removed 8 redundant places. [2025-01-10 06:40:41,085 INFO L231 Difference]: Finished difference. Result has 250 places, 391 transitions, 7116 flow [2025-01-10 06:40:41,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=6284, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7116, PETRI_PLACES=250, PETRI_TRANSITIONS=391} [2025-01-10 06:40:41,086 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 215 predicate places. [2025-01-10 06:40:41,086 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 391 transitions, 7116 flow [2025-01-10 06:40:41,086 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:41,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:41,086 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,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:40:41,086 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:41,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:41,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1281673688, now seen corresponding path program 3 times [2025-01-10 06:40:41,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:41,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614229255] [2025-01-10 06:40:41,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:41,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:41,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:41,100 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,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:41,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:41,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:41,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614229255] [2025-01-10 06:40:41,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614229255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:41,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:41,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:41,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214071629] [2025-01-10 06:40:41,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:41,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:41,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:41,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:41,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:41,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:41,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 391 transitions, 7116 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:41,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:41,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:41,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:42,305 INFO L124 PetriNetUnfolderBase]: 2046/3930 cut-off events. [2025-01-10 06:40:42,305 INFO L125 PetriNetUnfolderBase]: For 78405/78407 co-relation queries the response was YES. [2025-01-10 06:40:42,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27059 conditions, 3930 events. 2046/3930 cut-off events. For 78405/78407 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 28839 event pairs, 871 based on Foata normal form. 28/3832 useless extension candidates. Maximal degree in co-relation 26605. Up to 2918 conditions per place. [2025-01-10 06:40:42,345 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 366 selfloop transitions, 97 changer transitions 6/470 dead transitions. [2025-01-10 06:40:42,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 470 transitions, 8698 flow [2025-01-10 06:40:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 06:40:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 06:40:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 210 transitions. [2025-01-10 06:40:42,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32507739938080493 [2025-01-10 06:40:42,347 INFO L175 Difference]: Start difference. First operand has 250 places, 391 transitions, 7116 flow. Second operand 19 states and 210 transitions. [2025-01-10 06:40:42,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 470 transitions, 8698 flow [2025-01-10 06:40:42,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 470 transitions, 8461 flow, removed 99 selfloop flow, removed 4 redundant places. [2025-01-10 06:40:42,774 INFO L231 Difference]: Finished difference. Result has 271 places, 398 transitions, 7319 flow [2025-01-10 06:40:42,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=6927, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7319, PETRI_PLACES=271, PETRI_TRANSITIONS=398} [2025-01-10 06:40:42,775 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 236 predicate places. [2025-01-10 06:40:42,775 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 398 transitions, 7319 flow [2025-01-10 06:40:42,775 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:42,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:42,775 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,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:40:42,775 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:42,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:42,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1714398118, now seen corresponding path program 1 times [2025-01-10 06:40:42,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:42,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250160174] [2025-01-10 06:40:42,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:42,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:42,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:42,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:42,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:42,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:42,818 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,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:42,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250160174] [2025-01-10 06:40:42,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250160174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:42,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:42,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:40:42,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945571409] [2025-01-10 06:40:42,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:42,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:40:42,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:42,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:40:42,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:40:42,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-10 06:40:42,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 398 transitions, 7319 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:42,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:42,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-10 06:40:42,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:43,176 INFO L124 PetriNetUnfolderBase]: 1153/2232 cut-off events. [2025-01-10 06:40:43,176 INFO L125 PetriNetUnfolderBase]: For 42683/42683 co-relation queries the response was YES. [2025-01-10 06:40:43,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15062 conditions, 2232 events. 1153/2232 cut-off events. For 42683/42683 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15233 event pairs, 228 based on Foata normal form. 0/2168 useless extension candidates. Maximal degree in co-relation 14848. Up to 1416 conditions per place. [2025-01-10 06:40:43,197 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 365 selfloop transitions, 46 changer transitions 19/430 dead transitions. [2025-01-10 06:40:43,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 430 transitions, 9020 flow [2025-01-10 06:40:43,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:40:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:40:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-01-10 06:40:43,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2025-01-10 06:40:43,199 INFO L175 Difference]: Start difference. First operand has 271 places, 398 transitions, 7319 flow. Second operand 4 states and 66 transitions. [2025-01-10 06:40:43,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 430 transitions, 9020 flow [2025-01-10 06:40:43,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 430 transitions, 8629 flow, removed 54 selfloop flow, removed 15 redundant places. [2025-01-10 06:40:43,345 INFO L231 Difference]: Finished difference. Result has 254 places, 285 transitions, 5175 flow [2025-01-10 06:40:43,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5312, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5175, PETRI_PLACES=254, PETRI_TRANSITIONS=285} [2025-01-10 06:40:43,346 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 219 predicate places. [2025-01-10 06:40:43,346 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 285 transitions, 5175 flow [2025-01-10 06:40:43,346 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:43,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:43,346 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,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:40:43,346 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:43,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:43,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1144929476, now seen corresponding path program 4 times [2025-01-10 06:40:43,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:43,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446678394] [2025-01-10 06:40:43,347 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:40:43,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:43,359 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-01-10 06:40:43,365 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:43,365 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:40:43,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:43,745 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:43,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:43,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446678394] [2025-01-10 06:40:43,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446678394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:43,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:43,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071165285] [2025-01-10 06:40:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:43,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:43,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:43,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:43,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:43,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 285 transitions, 5175 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:43,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:43,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:43,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:44,372 INFO L124 PetriNetUnfolderBase]: 1131/2190 cut-off events. [2025-01-10 06:40:44,373 INFO L125 PetriNetUnfolderBase]: For 32492/32492 co-relation queries the response was YES. [2025-01-10 06:40:44,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14707 conditions, 2190 events. 1131/2190 cut-off events. For 32492/32492 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 14245 event pairs, 444 based on Foata normal form. 26/2152 useless extension candidates. Maximal degree in co-relation 14611. Up to 1547 conditions per place. [2025-01-10 06:40:44,392 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 216 selfloop transitions, 106 changer transitions 16/338 dead transitions. [2025-01-10 06:40:44,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 338 transitions, 6471 flow [2025-01-10 06:40:44,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:40:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:40:44,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 152 transitions. [2025-01-10 06:40:44,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31932773109243695 [2025-01-10 06:40:44,393 INFO L175 Difference]: Start difference. First operand has 254 places, 285 transitions, 5175 flow. Second operand 14 states and 152 transitions. [2025-01-10 06:40:44,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 338 transitions, 6471 flow [2025-01-10 06:40:44,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 338 transitions, 6319 flow, removed 17 selfloop flow, removed 9 redundant places. [2025-01-10 06:40:44,551 INFO L231 Difference]: Finished difference. Result has 252 places, 291 transitions, 5473 flow [2025-01-10 06:40:44,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5056, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5473, PETRI_PLACES=252, PETRI_TRANSITIONS=291} [2025-01-10 06:40:44,552 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 217 predicate places. [2025-01-10 06:40:44,552 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 291 transitions, 5473 flow [2025-01-10 06:40:44,552 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:44,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:44,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:44,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:40:44,552 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:44,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:44,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1283457626, now seen corresponding path program 5 times [2025-01-10 06:40:44,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:44,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386481461] [2025-01-10 06:40:44,553 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 06:40:44,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:44,563 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:44,567 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:44,567 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:44,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:44,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:44,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386481461] [2025-01-10 06:40:44,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386481461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:44,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:44,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:44,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349972130] [2025-01-10 06:40:44,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:44,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:44,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:44,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:44,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:44,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:44,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 291 transitions, 5473 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:44,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:44,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:44,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:45,646 INFO L124 PetriNetUnfolderBase]: 1217/2386 cut-off events. [2025-01-10 06:40:45,647 INFO L125 PetriNetUnfolderBase]: For 35988/35988 co-relation queries the response was YES. [2025-01-10 06:40:45,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15743 conditions, 2386 events. 1217/2386 cut-off events. For 35988/35988 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16039 event pairs, 500 based on Foata normal form. 16/2338 useless extension candidates. Maximal degree in co-relation 15454. Up to 1703 conditions per place. [2025-01-10 06:40:45,672 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 262 selfloop transitions, 94 changer transitions 15/371 dead transitions. [2025-01-10 06:40:45,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 371 transitions, 6924 flow [2025-01-10 06:40:45,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 06:40:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 06:40:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 191 transitions. [2025-01-10 06:40:45,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31209150326797386 [2025-01-10 06:40:45,674 INFO L175 Difference]: Start difference. First operand has 252 places, 291 transitions, 5473 flow. Second operand 18 states and 191 transitions. [2025-01-10 06:40:45,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 371 transitions, 6924 flow [2025-01-10 06:40:45,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 371 transitions, 6818 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-01-10 06:40:45,861 INFO L231 Difference]: Finished difference. Result has 269 places, 299 transitions, 5803 flow [2025-01-10 06:40:45,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5387, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5803, PETRI_PLACES=269, PETRI_TRANSITIONS=299} [2025-01-10 06:40:45,862 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 234 predicate places. [2025-01-10 06:40:45,862 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 299 transitions, 5803 flow [2025-01-10 06:40:45,862 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:45,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:45,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:45,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 06:40:45,863 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:45,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:45,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1139265565, now seen corresponding path program 1 times [2025-01-10 06:40:45,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:45,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353419669] [2025-01-10 06:40:45,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:45,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:45,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:45,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:45,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:45,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:46,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:46,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353419669] [2025-01-10 06:40:46,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353419669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:46,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:46,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:46,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43742441] [2025-01-10 06:40:46,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:46,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:46,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:46,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:46,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:46,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:46,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 299 transitions, 5803 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:46,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:46,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:46,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:46,982 INFO L124 PetriNetUnfolderBase]: 1219/2414 cut-off events. [2025-01-10 06:40:46,982 INFO L125 PetriNetUnfolderBase]: For 39779/39779 co-relation queries the response was YES. [2025-01-10 06:40:46,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16551 conditions, 2414 events. 1219/2414 cut-off events. For 39779/39779 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16326 event pairs, 433 based on Foata normal form. 0/2382 useless extension candidates. Maximal degree in co-relation 16272. Up to 882 conditions per place. [2025-01-10 06:40:46,997 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 231 selfloop transitions, 142 changer transitions 17/390 dead transitions. [2025-01-10 06:40:46,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 390 transitions, 7625 flow [2025-01-10 06:40:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 06:40:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-10 06:40:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 224 transitions. [2025-01-10 06:40:46,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2864450127877238 [2025-01-10 06:40:46,999 INFO L175 Difference]: Start difference. First operand has 269 places, 299 transitions, 5803 flow. Second operand 23 states and 224 transitions. [2025-01-10 06:40:46,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 390 transitions, 7625 flow [2025-01-10 06:40:47,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 390 transitions, 7463 flow, removed 36 selfloop flow, removed 8 redundant places. [2025-01-10 06:40:47,180 INFO L231 Difference]: Finished difference. Result has 288 places, 311 transitions, 6239 flow [2025-01-10 06:40:47,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5643, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=6239, PETRI_PLACES=288, PETRI_TRANSITIONS=311} [2025-01-10 06:40:47,182 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 253 predicate places. [2025-01-10 06:40:47,182 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 311 transitions, 6239 flow [2025-01-10 06:40:47,183 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:47,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:47,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:47,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:40:47,183 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:47,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1285245086, now seen corresponding path program 6 times [2025-01-10 06:40:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:47,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665372341] [2025-01-10 06:40:47,184 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 06:40:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:47,196 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:47,203 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:47,203 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-10 06:40:47,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:47,487 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:47,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665372341] [2025-01-10 06:40:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665372341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:47,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:47,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887095881] [2025-01-10 06:40:47,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:47,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:47,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:47,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:47,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:47,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 311 transitions, 6239 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:47,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:47,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:47,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:48,110 INFO L124 PetriNetUnfolderBase]: 1175/2326 cut-off events. [2025-01-10 06:40:48,110 INFO L125 PetriNetUnfolderBase]: For 41852/41852 co-relation queries the response was YES. [2025-01-10 06:40:48,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16378 conditions, 2326 events. 1175/2326 cut-off events. For 41852/41852 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 15650 event pairs, 484 based on Foata normal form. 16/2342 useless extension candidates. Maximal degree in co-relation 16065. Up to 1732 conditions per place. [2025-01-10 06:40:48,129 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 254 selfloop transitions, 92 changer transitions 12/358 dead transitions. [2025-01-10 06:40:48,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 358 transitions, 7191 flow [2025-01-10 06:40:48,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 06:40:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 06:40:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 160 transitions. [2025-01-10 06:40:48,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3137254901960784 [2025-01-10 06:40:48,132 INFO L175 Difference]: Start difference. First operand has 288 places, 311 transitions, 6239 flow. Second operand 15 states and 160 transitions. [2025-01-10 06:40:48,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 358 transitions, 7191 flow [2025-01-10 06:40:48,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 358 transitions, 7000 flow, removed 17 selfloop flow, removed 12 redundant places. [2025-01-10 06:40:48,316 INFO L231 Difference]: Finished difference. Result has 291 places, 311 transitions, 6258 flow [2025-01-10 06:40:48,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=6051, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6258, PETRI_PLACES=291, PETRI_TRANSITIONS=311} [2025-01-10 06:40:48,316 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 256 predicate places. [2025-01-10 06:40:48,316 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 311 transitions, 6258 flow [2025-01-10 06:40:48,316 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:48,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:48,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:48,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:40:48,317 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:48,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:48,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1139265566, now seen corresponding path program 1 times [2025-01-10 06:40:48,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:48,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489844394] [2025-01-10 06:40:48,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:40:48,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:48,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:48,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:48,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:48,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:48,523 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:48,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:48,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489844394] [2025-01-10 06:40:48,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489844394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:48,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:48,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:48,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182347079] [2025-01-10 06:40:48,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:48,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:48,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:48,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:48,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:48,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:48,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 311 transitions, 6258 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:48,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:48,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:48,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:49,092 INFO L124 PetriNetUnfolderBase]: 1093/2172 cut-off events. [2025-01-10 06:40:49,093 INFO L125 PetriNetUnfolderBase]: For 42385/42385 co-relation queries the response was YES. [2025-01-10 06:40:49,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15587 conditions, 2172 events. 1093/2172 cut-off events. For 42385/42385 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14419 event pairs, 225 based on Foata normal form. 32/2204 useless extension candidates. Maximal degree in co-relation 15276. Up to 490 conditions per place. [2025-01-10 06:40:49,112 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 212 selfloop transitions, 123 changer transitions 32/367 dead transitions. [2025-01-10 06:40:49,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 367 transitions, 7425 flow [2025-01-10 06:40:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:40:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:40:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 185 transitions. [2025-01-10 06:40:49,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32006920415224915 [2025-01-10 06:40:49,113 INFO L175 Difference]: Start difference. First operand has 291 places, 311 transitions, 6258 flow. Second operand 17 states and 185 transitions. [2025-01-10 06:40:49,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 367 transitions, 7425 flow [2025-01-10 06:40:49,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 367 transitions, 7245 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-01-10 06:40:49,293 INFO L231 Difference]: Finished difference. Result has 300 places, 296 transitions, 5964 flow [2025-01-10 06:40:49,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=6061, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5964, PETRI_PLACES=300, PETRI_TRANSITIONS=296} [2025-01-10 06:40:49,294 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 265 predicate places. [2025-01-10 06:40:49,294 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 296 transitions, 5964 flow [2025-01-10 06:40:49,294 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:49,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:49,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:49,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:40:49,294 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:49,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:49,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1139480605, now seen corresponding path program 2 times [2025-01-10 06:40:49,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:49,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995541915] [2025-01-10 06:40:49,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:49,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:49,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:49,309 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:49,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:49,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:49,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:49,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995541915] [2025-01-10 06:40:49,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995541915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:49,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:49,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:49,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761339755] [2025-01-10 06:40:49,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:49,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:49,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:49,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:49,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:49,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:49,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 296 transitions, 5964 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:49,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:49,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:49,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:50,118 INFO L124 PetriNetUnfolderBase]: 982/1953 cut-off events. [2025-01-10 06:40:50,119 INFO L125 PetriNetUnfolderBase]: For 38143/38143 co-relation queries the response was YES. [2025-01-10 06:40:50,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14423 conditions, 1953 events. 982/1953 cut-off events. For 38143/38143 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12587 event pairs, 396 based on Foata normal form. 16/1969 useless extension candidates. Maximal degree in co-relation 14111. Up to 1479 conditions per place. [2025-01-10 06:40:50,136 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 197 selfloop transitions, 58 changer transitions 67/322 dead transitions. [2025-01-10 06:40:50,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 322 transitions, 6656 flow [2025-01-10 06:40:50,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:40:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:40:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 143 transitions. [2025-01-10 06:40:50,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3004201680672269 [2025-01-10 06:40:50,137 INFO L175 Difference]: Start difference. First operand has 300 places, 296 transitions, 5964 flow. Second operand 14 states and 143 transitions. [2025-01-10 06:40:50,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 322 transitions, 6656 flow [2025-01-10 06:40:50,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 322 transitions, 6365 flow, removed 29 selfloop flow, removed 13 redundant places. [2025-01-10 06:40:50,343 INFO L231 Difference]: Finished difference. Result has 292 places, 241 transitions, 4628 flow [2025-01-10 06:40:50,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5641, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4628, PETRI_PLACES=292, PETRI_TRANSITIONS=241} [2025-01-10 06:40:50,344 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 257 predicate places. [2025-01-10 06:40:50,344 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 241 transitions, 4628 flow [2025-01-10 06:40:50,344 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:50,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:50,344 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:50,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:40:50,344 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:50,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1986023714, now seen corresponding path program 7 times [2025-01-10 06:40:50,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:50,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164724224] [2025-01-10 06:40:50,345 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 06:40:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:50,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:50,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:50,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:40:50,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:50,498 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:50,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164724224] [2025-01-10 06:40:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164724224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:50,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:50,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839909959] [2025-01-10 06:40:50,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:50,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:50,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:50,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:50,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:50,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 241 transitions, 4628 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:50,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:50,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:50,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:51,105 INFO L124 PetriNetUnfolderBase]: 951/1908 cut-off events. [2025-01-10 06:40:51,106 INFO L125 PetriNetUnfolderBase]: For 30415/30415 co-relation queries the response was YES. [2025-01-10 06:40:51,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12768 conditions, 1908 events. 951/1908 cut-off events. For 30415/30415 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12414 event pairs, 165 based on Foata normal form. 48/1956 useless extension candidates. Maximal degree in co-relation 12537. Up to 583 conditions per place. [2025-01-10 06:40:51,122 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 189 selfloop transitions, 116 changer transitions 7/312 dead transitions. [2025-01-10 06:40:51,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 312 transitions, 5901 flow [2025-01-10 06:40:51,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:40:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:40:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 188 transitions. [2025-01-10 06:40:51,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32525951557093424 [2025-01-10 06:40:51,124 INFO L175 Difference]: Start difference. First operand has 292 places, 241 transitions, 4628 flow. Second operand 17 states and 188 transitions. [2025-01-10 06:40:51,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 312 transitions, 5901 flow [2025-01-10 06:40:51,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 312 transitions, 5412 flow, removed 44 selfloop flow, removed 35 redundant places. [2025-01-10 06:40:51,232 INFO L231 Difference]: Finished difference. Result has 268 places, 253 transitions, 4691 flow [2025-01-10 06:40:51,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4183, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4691, PETRI_PLACES=268, PETRI_TRANSITIONS=253} [2025-01-10 06:40:51,233 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 233 predicate places. [2025-01-10 06:40:51,233 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 253 transitions, 4691 flow [2025-01-10 06:40:51,233 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:51,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:51,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:51,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:40:51,234 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:51,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:51,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1986023715, now seen corresponding path program 3 times [2025-01-10 06:40:51,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:51,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520809176] [2025-01-10 06:40:51,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:51,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:51,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:51,247 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:51,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:51,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:51,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:51,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520809176] [2025-01-10 06:40:51,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520809176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:51,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:51,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:51,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345149282] [2025-01-10 06:40:51,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:51,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:51,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:51,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:51,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:51,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 253 transitions, 4691 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:51,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:51,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:51,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:52,237 INFO L124 PetriNetUnfolderBase]: 879/1768 cut-off events. [2025-01-10 06:40:52,237 INFO L125 PetriNetUnfolderBase]: For 26828/26828 co-relation queries the response was YES. [2025-01-10 06:40:52,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11932 conditions, 1768 events. 879/1768 cut-off events. For 26828/26828 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11273 event pairs, 290 based on Foata normal form. 38/1806 useless extension candidates. Maximal degree in co-relation 11705. Up to 781 conditions per place. [2025-01-10 06:40:52,252 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 190 selfloop transitions, 79 changer transitions 50/319 dead transitions. [2025-01-10 06:40:52,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 319 transitions, 5863 flow [2025-01-10 06:40:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 06:40:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-10 06:40:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 219 transitions. [2025-01-10 06:40:52,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28005115089514065 [2025-01-10 06:40:52,253 INFO L175 Difference]: Start difference. First operand has 268 places, 253 transitions, 4691 flow. Second operand 23 states and 219 transitions. [2025-01-10 06:40:52,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 319 transitions, 5863 flow [2025-01-10 06:40:52,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 319 transitions, 5551 flow, removed 38 selfloop flow, removed 10 redundant places. [2025-01-10 06:40:52,378 INFO L231 Difference]: Finished difference. Result has 280 places, 230 transitions, 4133 flow [2025-01-10 06:40:52,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4381, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4133, PETRI_PLACES=280, PETRI_TRANSITIONS=230} [2025-01-10 06:40:52,378 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 245 predicate places. [2025-01-10 06:40:52,379 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 230 transitions, 4133 flow [2025-01-10 06:40:52,379 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:52,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:52,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:52,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:40:52,380 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:52,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:52,380 INFO L85 PathProgramCache]: Analyzing trace with hash 468706782, now seen corresponding path program 2 times [2025-01-10 06:40:52,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:52,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553846227] [2025-01-10 06:40:52,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:52,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:52,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:52,403 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:52,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:52,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:52,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:52,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:52,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553846227] [2025-01-10 06:40:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553846227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:52,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:52,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:40:52,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49194177] [2025-01-10 06:40:52,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:52,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:40:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:52,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:40:52,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:40:52,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:52,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 230 transitions, 4133 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:52,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:52,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:52,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:53,595 INFO L124 PetriNetUnfolderBase]: 826/1645 cut-off events. [2025-01-10 06:40:53,595 INFO L125 PetriNetUnfolderBase]: For 21862/21862 co-relation queries the response was YES. [2025-01-10 06:40:53,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10902 conditions, 1645 events. 826/1645 cut-off events. For 21862/21862 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10169 event pairs, 267 based on Foata normal form. 16/1661 useless extension candidates. Maximal degree in co-relation 10678. Up to 797 conditions per place. [2025-01-10 06:40:53,609 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 181 selfloop transitions, 106 changer transitions 5/292 dead transitions. [2025-01-10 06:40:53,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 292 transitions, 5255 flow [2025-01-10 06:40:53,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-10 06:40:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-01-10 06:40:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 240 transitions. [2025-01-10 06:40:53,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26143790849673204 [2025-01-10 06:40:53,610 INFO L175 Difference]: Start difference. First operand has 280 places, 230 transitions, 4133 flow. Second operand 27 states and 240 transitions. [2025-01-10 06:40:53,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 292 transitions, 5255 flow [2025-01-10 06:40:53,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 292 transitions, 4942 flow, removed 47 selfloop flow, removed 16 redundant places. [2025-01-10 06:40:53,686 INFO L231 Difference]: Finished difference. Result has 287 places, 244 transitions, 4423 flow [2025-01-10 06:40:53,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3878, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=4423, PETRI_PLACES=287, PETRI_TRANSITIONS=244} [2025-01-10 06:40:53,689 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 252 predicate places. [2025-01-10 06:40:53,689 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 244 transitions, 4423 flow [2025-01-10 06:40:53,689 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:53,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:53,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:53,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 06:40:53,689 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:53,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:53,690 INFO L85 PathProgramCache]: Analyzing trace with hash 728782212, now seen corresponding path program 3 times [2025-01-10 06:40:53,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:53,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000497339] [2025-01-10 06:40:53,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:53,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:53,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:53,706 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:53,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:40:53,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:54,021 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:54,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:54,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000497339] [2025-01-10 06:40:54,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000497339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:54,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:54,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:40:54,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871768436] [2025-01-10 06:40:54,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:54,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:40:54,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:54,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:40:54,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:40:54,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:54,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 244 transitions, 4423 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:54,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:54,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:54,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:54,866 INFO L124 PetriNetUnfolderBase]: 944/1883 cut-off events. [2025-01-10 06:40:54,867 INFO L125 PetriNetUnfolderBase]: For 21270/21270 co-relation queries the response was YES. [2025-01-10 06:40:54,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11984 conditions, 1883 events. 944/1883 cut-off events. For 21270/21270 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 12160 event pairs, 275 based on Foata normal form. 8/1891 useless extension candidates. Maximal degree in co-relation 11760. Up to 833 conditions per place. [2025-01-10 06:40:54,880 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 189 selfloop transitions, 115 changer transitions 5/309 dead transitions. [2025-01-10 06:40:54,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 309 transitions, 5458 flow [2025-01-10 06:40:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-10 06:40:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-10 06:40:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 227 transitions. [2025-01-10 06:40:54,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25678733031674206 [2025-01-10 06:40:54,881 INFO L175 Difference]: Start difference. First operand has 287 places, 244 transitions, 4423 flow. Second operand 26 states and 227 transitions. [2025-01-10 06:40:54,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 309 transitions, 5458 flow [2025-01-10 06:40:54,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 309 transitions, 5294 flow, removed 15 selfloop flow, removed 15 redundant places. [2025-01-10 06:40:54,955 INFO L231 Difference]: Finished difference. Result has 299 places, 252 transitions, 4696 flow [2025-01-10 06:40:54,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4265, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=4696, PETRI_PLACES=299, PETRI_TRANSITIONS=252} [2025-01-10 06:40:54,955 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 264 predicate places. [2025-01-10 06:40:54,955 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 252 transitions, 4696 flow [2025-01-10 06:40:54,955 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:54,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:54,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:54,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 06:40:54,956 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:54,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:54,956 INFO L85 PathProgramCache]: Analyzing trace with hash 487783842, now seen corresponding path program 8 times [2025-01-10 06:40:54,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:54,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945667354] [2025-01-10 06:40:54,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:54,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:54,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:54,968 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:54,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:54,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:40:55,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:55,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945667354] [2025-01-10 06:40:55,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945667354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:55,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:55,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:40:55,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159203234] [2025-01-10 06:40:55,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:55,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:40:55,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:55,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:40:55,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:40:55,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:55,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 252 transitions, 4696 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:55,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:55,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:55,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:55,765 INFO L124 PetriNetUnfolderBase]: 988/1989 cut-off events. [2025-01-10 06:40:55,765 INFO L125 PetriNetUnfolderBase]: For 25126/25126 co-relation queries the response was YES. [2025-01-10 06:40:55,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12732 conditions, 1989 events. 988/1989 cut-off events. For 25126/25126 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 13190 event pairs, 179 based on Foata normal form. 38/2027 useless extension candidates. Maximal degree in co-relation 12381. Up to 313 conditions per place. [2025-01-10 06:40:55,778 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 202 selfloop transitions, 112 changer transitions 9/323 dead transitions. [2025-01-10 06:40:55,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 323 transitions, 5849 flow [2025-01-10 06:40:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 06:40:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 06:40:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 210 transitions. [2025-01-10 06:40:55,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32507739938080493 [2025-01-10 06:40:55,779 INFO L175 Difference]: Start difference. First operand has 299 places, 252 transitions, 4696 flow. Second operand 19 states and 210 transitions. [2025-01-10 06:40:55,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 323 transitions, 5849 flow [2025-01-10 06:40:55,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 323 transitions, 5717 flow, removed 30 selfloop flow, removed 12 redundant places. [2025-01-10 06:40:55,859 INFO L231 Difference]: Finished difference. Result has 310 places, 252 transitions, 4871 flow [2025-01-10 06:40:55,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4602, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4871, PETRI_PLACES=310, PETRI_TRANSITIONS=252} [2025-01-10 06:40:55,859 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 275 predicate places. [2025-01-10 06:40:55,859 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 252 transitions, 4871 flow [2025-01-10 06:40:55,860 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:55,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:55,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:55,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 06:40:55,860 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:55,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:55,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2114789132, now seen corresponding path program 4 times [2025-01-10 06:40:55,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:55,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274496214] [2025-01-10 06:40:55,861 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:40:55,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:55,871 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-01-10 06:40:55,874 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:55,875 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:40:55,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:56,236 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:56,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:56,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274496214] [2025-01-10 06:40:56,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274496214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:56,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:56,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:56,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580838089] [2025-01-10 06:40:56,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:56,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:56,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:56,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:56,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:56,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:56,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 252 transitions, 4871 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:56,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:56,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:56,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:57,087 INFO L124 PetriNetUnfolderBase]: 884/1799 cut-off events. [2025-01-10 06:40:57,087 INFO L125 PetriNetUnfolderBase]: For 25093/25093 co-relation queries the response was YES. [2025-01-10 06:40:57,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11898 conditions, 1799 events. 884/1799 cut-off events. For 25093/25093 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11756 event pairs, 236 based on Foata normal form. 56/1855 useless extension candidates. Maximal degree in co-relation 11650. Up to 983 conditions per place. [2025-01-10 06:40:57,100 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 217 selfloop transitions, 91 changer transitions 5/313 dead transitions. [2025-01-10 06:40:57,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 313 transitions, 5827 flow [2025-01-10 06:40:57,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 06:40:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-10 06:40:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 250 transitions. [2025-01-10 06:40:57,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26260504201680673 [2025-01-10 06:40:57,102 INFO L175 Difference]: Start difference. First operand has 310 places, 252 transitions, 4871 flow. Second operand 28 states and 250 transitions. [2025-01-10 06:40:57,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 313 transitions, 5827 flow [2025-01-10 06:40:57,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 313 transitions, 5214 flow, removed 120 selfloop flow, removed 30 redundant places. [2025-01-10 06:40:57,189 INFO L231 Difference]: Finished difference. Result has 306 places, 253 transitions, 4497 flow [2025-01-10 06:40:57,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4301, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4497, PETRI_PLACES=306, PETRI_TRANSITIONS=253} [2025-01-10 06:40:57,190 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 271 predicate places. [2025-01-10 06:40:57,190 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 253 transitions, 4497 flow [2025-01-10 06:40:57,190 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:57,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:57,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:57,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 06:40:57,190 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:57,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash 294059473, now seen corresponding path program 2 times [2025-01-10 06:40:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:57,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071138824] [2025-01-10 06:40:57,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:40:57,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:57,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:40:57,206 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:57,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:40:57,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:57,554 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:57,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:57,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071138824] [2025-01-10 06:40:57,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071138824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:57,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:57,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:40:57,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788308827] [2025-01-10 06:40:57,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:57,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:40:57,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:57,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:40:57,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:40:57,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:57,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 253 transitions, 4497 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:57,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:57,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:57,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:58,455 INFO L124 PetriNetUnfolderBase]: 844/1727 cut-off events. [2025-01-10 06:40:58,455 INFO L125 PetriNetUnfolderBase]: For 15995/15995 co-relation queries the response was YES. [2025-01-10 06:40:58,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10618 conditions, 1727 events. 844/1727 cut-off events. For 15995/15995 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 11202 event pairs, 308 based on Foata normal form. 32/1759 useless extension candidates. Maximal degree in co-relation 10227. Up to 646 conditions per place. [2025-01-10 06:40:58,468 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 178 selfloop transitions, 80 changer transitions 40/298 dead transitions. [2025-01-10 06:40:58,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 298 transitions, 5319 flow [2025-01-10 06:40:58,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 06:40:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-10 06:40:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 218 transitions. [2025-01-10 06:40:58,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26715686274509803 [2025-01-10 06:40:58,470 INFO L175 Difference]: Start difference. First operand has 306 places, 253 transitions, 4497 flow. Second operand 24 states and 218 transitions. [2025-01-10 06:40:58,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 298 transitions, 5319 flow [2025-01-10 06:40:58,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 298 transitions, 5032 flow, removed 6 selfloop flow, removed 24 redundant places. [2025-01-10 06:40:58,531 INFO L231 Difference]: Finished difference. Result has 306 places, 230 transitions, 3901 flow [2025-01-10 06:40:58,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4204, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3901, PETRI_PLACES=306, PETRI_TRANSITIONS=230} [2025-01-10 06:40:58,532 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 271 predicate places. [2025-01-10 06:40:58,532 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 230 transitions, 3901 flow [2025-01-10 06:40:58,532 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:58,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:58,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:58,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-10 06:40:58,532 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:58,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:58,533 INFO L85 PathProgramCache]: Analyzing trace with hash 293844433, now seen corresponding path program 4 times [2025-01-10 06:40:58,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:58,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932843794] [2025-01-10 06:40:58,533 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 06:40:58,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:58,543 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-01-10 06:40:58,545 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:40:58,546 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 06:40:58,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:58,773 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:58,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:58,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932843794] [2025-01-10 06:40:58,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932843794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:40:58,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:40:58,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:40:58,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229660990] [2025-01-10 06:40:58,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:40:58,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:40:58,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:40:58,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:40:58,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:40:58,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:40:58,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 230 transitions, 3901 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:58,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:40:58,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:40:58,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:40:59,264 INFO L124 PetriNetUnfolderBase]: 734/1527 cut-off events. [2025-01-10 06:40:59,264 INFO L125 PetriNetUnfolderBase]: For 12814/12814 co-relation queries the response was YES. [2025-01-10 06:40:59,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8977 conditions, 1527 events. 734/1527 cut-off events. For 12814/12814 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9713 event pairs, 290 based on Foata normal form. 28/1555 useless extension candidates. Maximal degree in co-relation 8671. Up to 573 conditions per place. [2025-01-10 06:40:59,274 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 143 selfloop transitions, 68 changer transitions 63/274 dead transitions. [2025-01-10 06:40:59,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 274 transitions, 4730 flow [2025-01-10 06:40:59,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 06:40:59,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 06:40:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 196 transitions. [2025-01-10 06:40:59,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27450980392156865 [2025-01-10 06:40:59,275 INFO L175 Difference]: Start difference. First operand has 306 places, 230 transitions, 3901 flow. Second operand 21 states and 196 transitions. [2025-01-10 06:40:59,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 274 transitions, 4730 flow [2025-01-10 06:40:59,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 274 transitions, 4399 flow, removed 20 selfloop flow, removed 29 redundant places. [2025-01-10 06:40:59,319 INFO L231 Difference]: Finished difference. Result has 291 places, 190 transitions, 3000 flow [2025-01-10 06:40:59,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3549, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3000, PETRI_PLACES=291, PETRI_TRANSITIONS=190} [2025-01-10 06:40:59,324 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 256 predicate places. [2025-01-10 06:40:59,324 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 190 transitions, 3000 flow [2025-01-10 06:40:59,324 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:59,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:40:59,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:40:59,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-10 06:40:59,325 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:40:59,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:40:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash -710199932, now seen corresponding path program 9 times [2025-01-10 06:40:59,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:40:59,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622448374] [2025-01-10 06:40:59,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:59,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:40:59,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-01-10 06:40:59,338 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:59,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 06:40:59,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:40:59,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:40:59,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622448374] [2025-01-10 06:40:59,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622448374] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:40:59,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705407262] [2025-01-10 06:40:59,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:40:59,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:40:59,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:40:59,586 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:59,603 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:59,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-01-10 06:40:59,731 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:59,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 06:40:59,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:40:59,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 06:40:59,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:40:59,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 06:40:59,892 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 21 treesize of output 20 [2025-01-10 06:40:59,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:40:59,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2025-01-10 06:40:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:40:59,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:40:59,997 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 38 treesize of output 32 [2025-01-10 06:41:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:41:00,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705407262] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:41:00,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:41:00,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 23 [2025-01-10 06:41:00,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419378982] [2025-01-10 06:41:00,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:41:00,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 06:41:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:00,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 06:41:00,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-01-10 06:41:00,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:41:00,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 190 transitions, 3000 flow. Second operand has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 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:00,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:00,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:41:00,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:02,092 INFO L124 PetriNetUnfolderBase]: 638/1341 cut-off events. [2025-01-10 06:41:02,092 INFO L125 PetriNetUnfolderBase]: For 7262/7262 co-relation queries the response was YES. [2025-01-10 06:41:02,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7119 conditions, 1341 events. 638/1341 cut-off events. For 7262/7262 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8402 event pairs, 113 based on Foata normal form. 22/1363 useless extension candidates. Maximal degree in co-relation 7066. Up to 238 conditions per place. [2025-01-10 06:41:02,104 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 169 selfloop transitions, 125 changer transitions 18/312 dead transitions. [2025-01-10 06:41:02,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 312 transitions, 3982 flow [2025-01-10 06:41:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-01-10 06:41:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-01-10 06:41:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 445 transitions. [2025-01-10 06:41:02,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23796791443850268 [2025-01-10 06:41:02,108 INFO L175 Difference]: Start difference. First operand has 291 places, 190 transitions, 3000 flow. Second operand 55 states and 445 transitions. [2025-01-10 06:41:02,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 312 transitions, 3982 flow [2025-01-10 06:41:02,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 312 transitions, 3608 flow, removed 12 selfloop flow, removed 36 redundant places. [2025-01-10 06:41:02,131 INFO L231 Difference]: Finished difference. Result has 296 places, 191 transitions, 2852 flow [2025-01-10 06:41:02,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2592, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=2852, PETRI_PLACES=296, PETRI_TRANSITIONS=191} [2025-01-10 06:41:02,132 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 261 predicate places. [2025-01-10 06:41:02,132 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 191 transitions, 2852 flow [2025-01-10 06:41:02,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 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:02,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:41:02,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:41:02,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:41:02,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:41:02,334 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-01-10 06:41:02,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:41:02,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1986238755, now seen corresponding path program 3 times [2025-01-10 06:41:02,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:41:02,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051738833] [2025-01-10 06:41:02,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:41:02,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:41:02,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-01-10 06:41:02,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:41:02,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 06:41:02,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:41:02,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:41:02,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051738833] [2025-01-10 06:41:02,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051738833] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:41:02,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855252577] [2025-01-10 06:41:02,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:41:02,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:41:02,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:41:02,649 INFO L229 MonitoredProcess]: Starting monitored process 3 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:41:02,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:41:02,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-01-10 06:41:02,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:41:02,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 06:41:02,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:41:02,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-10 06:41:02,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:41:02,856 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 22 treesize of output 1 [2025-01-10 06:41:02,985 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 23 treesize of output 11 [2025-01-10 06:41:02,994 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:41:03,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:41:03,061 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 1 case distinctions, treesize of input 43 treesize of output 23 [2025-01-10 06:41:03,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:41:03,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 06:41:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:41:03,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:41:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:41:08,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855252577] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:41:08,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:41:08,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2025-01-10 06:41:08,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218118630] [2025-01-10 06:41:08,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:41:08,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 06:41:08,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:41:08,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 06:41:08,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2025-01-10 06:41:08,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-01-10 06:41:08,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 191 transitions, 2852 flow. Second operand has 28 states, 28 states have (on average 5.428571428571429) internal successors, (152), 28 states have internal predecessors, (152), 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:08,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:41:08,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-01-10 06:41:08,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:41:28,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:41:33,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:41:38,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]