./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-time-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-time-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef62179d17d90afe74c7b4fe8189ca3bb011e55daf3a169b42e4b3589691fc53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:09:31,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:09:31,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:09:31,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:09:31,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:09:31,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:09:31,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:09:31,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:09:31,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:09:31,367 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:09:31,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:09:31,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:09:31,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:09:31,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:09:31,368 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:09:31,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:09:31,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:09:31,368 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:09:31,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:09:31,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:09:31,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:09:31,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:09:31,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:09:31,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:09:31,368 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:09:31,368 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:09:31,368 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:09:31,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:09:31,369 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:09:31,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:09:31,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:09:31,369 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 -> ef62179d17d90afe74c7b4fe8189ca3bb011e55daf3a169b42e4b3589691fc53 [2025-02-08 14:09:31,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:09:31,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:09:31,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:09:31,554 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:09:31,554 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:09:31,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-time-trans.wvr.c [2025-02-08 14:09:32,753 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/769333f5e/350892eb5ef7455cbd914ffef679e3c6/FLAG864ec2559 [2025-02-08 14:09:33,037 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:09:33,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-time-trans.wvr.c [2025-02-08 14:09:33,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/769333f5e/350892eb5ef7455cbd914ffef679e3c6/FLAG864ec2559 [2025-02-08 14:09:33,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/769333f5e/350892eb5ef7455cbd914ffef679e3c6 [2025-02-08 14:09:33,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:09:33,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:09:33,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:09:33,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:09:33,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:09:33,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:09:33" (1/1) ... [2025-02-08 14:09:33,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321e4ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33, skipping insertion in model container [2025-02-08 14:09:33,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:09:33" (1/1) ... [2025-02-08 14:09:33,083 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:09:33,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:09:33,199 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:09:33,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:09:33,227 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:09:33,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33 WrapperNode [2025-02-08 14:09:33,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:09:33,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:09:33,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:09:33,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:09:33,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33" (1/1) ... [2025-02-08 14:09:33,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33" (1/1) ... [2025-02-08 14:09:33,257 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 293 [2025-02-08 14:09:33,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:09:33,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:09:33,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:09:33,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:09:33,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33" (1/1) ... [2025-02-08 14:09:33,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33" (1/1) ... [2025-02-08 14:09:33,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33" (1/1) ... [2025-02-08 14:09:33,302 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 14:09:33,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33" (1/1) ... [2025-02-08 14:09:33,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33" (1/1) ... [2025-02-08 14:09:33,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33" (1/1) ... [2025-02-08 14:09:33,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33" (1/1) ... [2025-02-08 14:09:33,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33" (1/1) ... [2025-02-08 14:09:33,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33" (1/1) ... [2025-02-08 14:09:33,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:09:33,322 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:09:33,322 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:09:33,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:09:33,323 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33" (1/1) ... [2025-02-08 14:09:33,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:09:33,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:33,366 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-02-08 14:09:33,374 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-02-08 14:09:33,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:09:33,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:09:33,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:09:33,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:09:33,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:09:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 14:09:33,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 14:09:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:09:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 14:09:33,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 14:09:33,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:09:33,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:09:33,391 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:09:33,470 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:09:33,471 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:09:33,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-3: #t~ite3#1 := #t~ret2#1; [2025-02-08 14:09:33,634 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 14:09:33,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:33,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-6: havoc minus_#t~short25#1, minus_#t~short26#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:33,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-7: #t~ret2#1 := minus_#res#1; [2025-02-08 14:09:33,712 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: #t~ite6#1 := #t~ret5#1; [2025-02-08 14:09:33,712 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 14:09:33,713 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:33,713 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-6: havoc minus_#t~short25#1, minus_#t~short26#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:33,713 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-7: #t~ret5#1 := minus_#res#1; [2025-02-08 14:09:33,806 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-3: #t~ite9#1 := #t~ret8#1; [2025-02-08 14:09:33,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 14:09:33,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 14:09:33,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-6: havoc minus_#t~short25#1, minus_#t~short26#1, minus_~a#1, minus_~b#1; [2025-02-08 14:09:33,807 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-7: #t~ret8#1 := minus_#res#1; [2025-02-08 14:09:33,857 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:09:33,857 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:09:34,297 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L101 is not an error location. [2025-02-08 14:09:34,297 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L101 is not an error location. [2025-02-08 14:09:34,298 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L101 is not an error location. [2025-02-08 14:09:34,298 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:09:34,298 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:09:34,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:09:34 BoogieIcfgContainer [2025-02-08 14:09:34,299 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:09:34,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:09:34,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:09:34,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:09:34,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:09:33" (1/3) ... [2025-02-08 14:09:34,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78516749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:09:34, skipping insertion in model container [2025-02-08 14:09:34,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:33" (2/3) ... [2025-02-08 14:09:34,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78516749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:09:34, skipping insertion in model container [2025-02-08 14:09:34,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:09:34" (3/3) ... [2025-02-08 14:09:34,309 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-time-trans.wvr.c [2025-02-08 14:09:34,327 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:09:34,328 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-time-trans.wvr.c that has 4 procedures, 63 locations, 1 initial locations, 0 loop locations, and 36 error locations. [2025-02-08 14:09:34,328 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:09:34,560 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:09:34,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 62 transitions, 145 flow [2025-02-08 14:09:34,611 INFO L124 PetriNetUnfolderBase]: 0/59 cut-off events. [2025-02-08 14:09:34,612 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 14:09:34,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 59 events. 0/59 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 262 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-02-08 14:09:34,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 62 transitions, 145 flow [2025-02-08 14:09:34,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 57 transitions, 129 flow [2025-02-08 14:09:34,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:09:34,631 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;@7e60ebec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:09:34,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2025-02-08 14:09:34,633 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:09:34,633 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-08 14:09:34,633 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:09:34,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:34,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:34,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-08 14:09:34,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:34,638 INFO L85 PathProgramCache]: Analyzing trace with hash 29574841, now seen corresponding path program 1 times [2025-02-08 14:09:34,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:34,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817634343] [2025-02-08 14:09:34,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:34,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:34,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:34,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:34,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:34,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:34,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:34,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817634343] [2025-02-08 14:09:34,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817634343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:34,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:34,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:34,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441901677] [2025-02-08 14:09:34,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:34,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 14:09:34,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:34,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 14:09:34,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 14:09:34,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 62 [2025-02-08 14:09:34,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 129 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-02-08 14:09:34,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:34,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 62 [2025-02-08 14:09:34,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:37,443 INFO L124 PetriNetUnfolderBase]: 8602/12671 cut-off events. [2025-02-08 14:09:37,443 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-02-08 14:09:37,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25673 conditions, 12671 events. 8602/12671 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 2513. Compared 97060 event pairs, 8602 based on Foata normal form. 0/4207 useless extension candidates. Maximal degree in co-relation 24644. Up to 12528 conditions per place. [2025-02-08 14:09:37,495 INFO L140 encePairwiseOnDemand]: 50/62 looper letters, 42 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2025-02-08 14:09:37,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 189 flow [2025-02-08 14:09:37,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 14:09:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 14:09:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2025-02-08 14:09:37,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2025-02-08 14:09:37,505 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 129 flow. Second operand 2 states and 66 transitions. [2025-02-08 14:09:37,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 189 flow [2025-02-08 14:09:37,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 180 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:09:37,516 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 96 flow [2025-02-08 14:09:37,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-02-08 14:09:37,520 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2025-02-08 14:09:37,520 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 96 flow [2025-02-08 14:09:37,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-02-08 14:09:37,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:37,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:37,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:09:37,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-08 14:09:37,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:37,522 INFO L85 PathProgramCache]: Analyzing trace with hash 29574842, now seen corresponding path program 1 times [2025-02-08 14:09:37,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:37,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926628441] [2025-02-08 14:09:37,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:37,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:37,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:37,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:37,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:37,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:37,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926628441] [2025-02-08 14:09:37,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926628441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:37,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:37,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:37,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075809221] [2025-02-08 14:09:37,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:37,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:37,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:37,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:37,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:37,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 62 [2025-02-08 14:09:37,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:37,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:37,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 62 [2025-02-08 14:09:37,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:39,016 INFO L124 PetriNetUnfolderBase]: 7203/10637 cut-off events. [2025-02-08 14:09:39,017 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 14:09:39,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21410 conditions, 10637 events. 7203/10637 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 2078. Compared 79797 event pairs, 7203 based on Foata normal form. 0/3651 useless extension candidates. Maximal degree in co-relation 21407. Up to 10516 conditions per place. [2025-02-08 14:09:39,046 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 39 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2025-02-08 14:09:39,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 172 flow [2025-02-08 14:09:39,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-02-08 14:09:39,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2025-02-08 14:09:39,047 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 96 flow. Second operand 3 states and 60 transitions. [2025-02-08 14:09:39,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 172 flow [2025-02-08 14:09:39,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:09:39,049 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 94 flow [2025-02-08 14:09:39,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2025-02-08 14:09:39,049 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2025-02-08 14:09:39,050 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 94 flow [2025-02-08 14:09:39,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:39,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:39,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:39,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:09:39,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-08 14:09:39,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:39,050 INFO L85 PathProgramCache]: Analyzing trace with hash 29574843, now seen corresponding path program 1 times [2025-02-08 14:09:39,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:39,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246146343] [2025-02-08 14:09:39,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:39,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:39,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:39,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:39,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:39,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:39,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:39,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246146343] [2025-02-08 14:09:39,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246146343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:39,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:39,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:39,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120806965] [2025-02-08 14:09:39,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:39,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:39,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:39,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:39,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:39,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 62 [2025-02-08 14:09:39,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:39,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:39,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 62 [2025-02-08 14:09:39,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:40,090 INFO L124 PetriNetUnfolderBase]: 5928/8781 cut-off events. [2025-02-08 14:09:40,091 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 14:09:40,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17678 conditions, 8781 events. 5928/8781 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 1685. Compared 64751 event pairs, 5928 based on Foata normal form. 0/3133 useless extension candidates. Maximal degree in co-relation 17674. Up to 8681 conditions per place. [2025-02-08 14:09:40,152 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 37 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2025-02-08 14:09:40,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 166 flow [2025-02-08 14:09:40,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-02-08 14:09:40,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3118279569892473 [2025-02-08 14:09:40,157 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 94 flow. Second operand 3 states and 58 transitions. [2025-02-08 14:09:40,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 166 flow [2025-02-08 14:09:40,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:40,158 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 91 flow [2025-02-08 14:09:40,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2025-02-08 14:09:40,158 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -17 predicate places. [2025-02-08 14:09:40,158 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 91 flow [2025-02-08 14:09:40,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:40,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:40,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:40,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:09:40,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-08 14:09:40,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:40,159 INFO L85 PathProgramCache]: Analyzing trace with hash 29574845, now seen corresponding path program 1 times [2025-02-08 14:09:40,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:40,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700149567] [2025-02-08 14:09:40,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:40,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:40,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:40,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:40,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:40,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:40,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:40,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700149567] [2025-02-08 14:09:40,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700149567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:40,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:40,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:40,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654559098] [2025-02-08 14:09:40,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:40,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:40,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:40,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:40,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 62 [2025-02-08 14:09:40,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:40,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:40,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 62 [2025-02-08 14:09:40,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:40,921 INFO L124 PetriNetUnfolderBase]: 4900/7290 cut-off events. [2025-02-08 14:09:40,922 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 14:09:40,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14686 conditions, 7290 events. 4900/7290 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 1365. Compared 52705 event pairs, 4900 based on Foata normal form. 0/2711 useless extension candidates. Maximal degree in co-relation 14682. Up to 7200 conditions per place. [2025-02-08 14:09:40,949 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 35 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2025-02-08 14:09:40,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 159 flow [2025-02-08 14:09:40,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-02-08 14:09:40,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3010752688172043 [2025-02-08 14:09:40,953 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 91 flow. Second operand 3 states and 56 transitions. [2025-02-08 14:09:40,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 159 flow [2025-02-08 14:09:40,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:40,954 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2025-02-08 14:09:40,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-02-08 14:09:40,955 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2025-02-08 14:09:40,955 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2025-02-08 14:09:40,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:40,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:40,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:40,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:09:40,956 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-08 14:09:40,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash 29574846, now seen corresponding path program 1 times [2025-02-08 14:09:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:40,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729070887] [2025-02-08 14:09:40,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:40,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:40,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:40,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:40,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:40,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:41,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:41,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729070887] [2025-02-08 14:09:41,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729070887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:41,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:41,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:41,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647804588] [2025-02-08 14:09:41,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:41,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:41,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:41,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:41,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:41,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 62 [2025-02-08 14:09:41,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:41,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:41,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 62 [2025-02-08 14:09:41,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:41,905 INFO L124 PetriNetUnfolderBase]: 3968/5935 cut-off events. [2025-02-08 14:09:41,905 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 14:09:41,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11966 conditions, 5935 events. 3968/5935 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 1079. Compared 41975 event pairs, 3968 based on Foata normal form. 0/2317 useless extension candidates. Maximal degree in co-relation 11962. Up to 5855 conditions per place. [2025-02-08 14:09:41,924 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 33 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2025-02-08 14:09:41,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 152 flow [2025-02-08 14:09:41,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-02-08 14:09:41,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2903225806451613 [2025-02-08 14:09:41,926 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 54 transitions. [2025-02-08 14:09:41,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 37 transitions, 152 flow [2025-02-08 14:09:41,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 37 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:41,927 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 85 flow [2025-02-08 14:09:41,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2025-02-08 14:09:41,928 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2025-02-08 14:09:41,928 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 85 flow [2025-02-08 14:09:41,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:41,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:41,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:41,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:09:41,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-08 14:09:41,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:41,929 INFO L85 PathProgramCache]: Analyzing trace with hash 29574849, now seen corresponding path program 1 times [2025-02-08 14:09:41,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:41,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365886961] [2025-02-08 14:09:41,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:41,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:41,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:41,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:41,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:41,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:41,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:41,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365886961] [2025-02-08 14:09:41,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365886961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:41,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:41,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:41,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753101501] [2025-02-08 14:09:41,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:41,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:41,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:41,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:41,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:41,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 62 [2025-02-08 14:09:41,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:41,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:41,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 62 [2025-02-08 14:09:41,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:42,695 INFO L124 PetriNetUnfolderBase]: 3107/4671 cut-off events. [2025-02-08 14:09:42,695 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 14:09:42,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9421 conditions, 4671 events. 3107/4671 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 32123 event pairs, 3107 based on Foata normal form. 0/1927 useless extension candidates. Maximal degree in co-relation 9417. Up to 4608 conditions per place. [2025-02-08 14:09:42,714 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 31 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2025-02-08 14:09:42,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 35 transitions, 145 flow [2025-02-08 14:09:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-02-08 14:09:42,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27956989247311825 [2025-02-08 14:09:42,715 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 85 flow. Second operand 3 states and 52 transitions. [2025-02-08 14:09:42,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 35 transitions, 145 flow [2025-02-08 14:09:42,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 35 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:42,716 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 82 flow [2025-02-08 14:09:42,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2025-02-08 14:09:42,717 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2025-02-08 14:09:42,717 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 82 flow [2025-02-08 14:09:42,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:42,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:42,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:42,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:09:42,717 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-08 14:09:42,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:42,718 INFO L85 PathProgramCache]: Analyzing trace with hash 29574850, now seen corresponding path program 1 times [2025-02-08 14:09:42,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:42,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519812490] [2025-02-08 14:09:42,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:42,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:42,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:42,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:42,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:42,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:42,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:42,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519812490] [2025-02-08 14:09:42,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519812490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:42,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:42,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:42,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361757382] [2025-02-08 14:09:42,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:42,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:42,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:42,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:42,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:42,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 62 [2025-02-08 14:09:42,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:42,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:42,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 62 [2025-02-08 14:09:42,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:43,176 INFO L124 PetriNetUnfolderBase]: 2350/3557 cut-off events. [2025-02-08 14:09:43,176 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 14:09:43,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7178 conditions, 3557 events. 2350/3557 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 23749 event pairs, 2350 based on Foata normal form. 0/1571 useless extension candidates. Maximal degree in co-relation 7174. Up to 3509 conditions per place. [2025-02-08 14:09:43,183 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 29 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2025-02-08 14:09:43,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 138 flow [2025-02-08 14:09:43,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-02-08 14:09:43,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26881720430107525 [2025-02-08 14:09:43,184 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 50 transitions. [2025-02-08 14:09:43,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 138 flow [2025-02-08 14:09:43,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 33 transitions, 137 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:43,185 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 79 flow [2025-02-08 14:09:43,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2025-02-08 14:09:43,186 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2025-02-08 14:09:43,186 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 79 flow [2025-02-08 14:09:43,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:43,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:43,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:43,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:09:43,186 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-08 14:09:43,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:43,187 INFO L85 PathProgramCache]: Analyzing trace with hash 29574852, now seen corresponding path program 1 times [2025-02-08 14:09:43,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:43,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983938475] [2025-02-08 14:09:43,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:43,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:43,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:43,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:43,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:43,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:43,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:43,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983938475] [2025-02-08 14:09:43,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983938475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:43,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:43,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:43,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312840678] [2025-02-08 14:09:43,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:43,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:43,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:43,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:43,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:43,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 62 [2025-02-08 14:09:43,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:43,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:43,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 62 [2025-02-08 14:09:43,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:43,473 INFO L124 PetriNetUnfolderBase]: 1764/2696 cut-off events. [2025-02-08 14:09:43,473 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 14:09:43,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5448 conditions, 2696 events. 1764/2696 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 17310 event pairs, 1764 based on Foata normal form. 0/1287 useless extension candidates. Maximal degree in co-relation 5444. Up to 2656 conditions per place. [2025-02-08 14:09:43,480 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 27 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2025-02-08 14:09:43,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 31 transitions, 131 flow [2025-02-08 14:09:43,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-02-08 14:09:43,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25806451612903225 [2025-02-08 14:09:43,481 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 79 flow. Second operand 3 states and 48 transitions. [2025-02-08 14:09:43,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 31 transitions, 131 flow [2025-02-08 14:09:43,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:43,482 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 76 flow [2025-02-08 14:09:43,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2025-02-08 14:09:43,482 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2025-02-08 14:09:43,482 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 76 flow [2025-02-08 14:09:43,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:43,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:43,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 14:09:43,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:09:43,483 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-08 14:09:43,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:43,483 INFO L85 PathProgramCache]: Analyzing trace with hash 29574853, now seen corresponding path program 1 times [2025-02-08 14:09:43,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:43,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160273993] [2025-02-08 14:09:43,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:43,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:43,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 14:09:43,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 14:09:43,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:43,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:43,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:43,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160273993] [2025-02-08 14:09:43,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160273993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:43,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:43,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:43,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456190239] [2025-02-08 14:09:43,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:43,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:43,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:43,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:43,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:43,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 62 [2025-02-08 14:09:43,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:43,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:43,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 62 [2025-02-08 14:09:43,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:43,703 INFO L124 PetriNetUnfolderBase]: 1254/1943 cut-off events. [2025-02-08 14:09:43,703 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 14:09:43,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3934 conditions, 1943 events. 1254/1943 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 11993 event pairs, 1254 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 3930. Up to 1911 conditions per place. [2025-02-08 14:09:43,708 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 25 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2025-02-08 14:09:43,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 29 transitions, 124 flow [2025-02-08 14:09:43,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-02-08 14:09:43,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24731182795698925 [2025-02-08 14:09:43,709 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 76 flow. Second operand 3 states and 46 transitions. [2025-02-08 14:09:43,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 29 transitions, 124 flow [2025-02-08 14:09:43,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 29 transitions, 123 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:43,709 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 73 flow [2025-02-08 14:09:43,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2025-02-08 14:09:43,710 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -23 predicate places. [2025-02-08 14:09:43,710 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 73 flow [2025-02-08 14:09:43,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-08 14:09:43,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:43,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:09:43,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:09:43,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-08 14:09:43,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:43,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1643361746, now seen corresponding path program 1 times [2025-02-08 14:09:43,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:43,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879525047] [2025-02-08 14:09:43,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:43,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:43,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:09:43,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:09:43,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:43,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:43,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:43,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879525047] [2025-02-08 14:09:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879525047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:43,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:43,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054734966] [2025-02-08 14:09:43,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:43,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:43,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:43,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:43,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 62 [2025-02-08 14:09:43,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-02-08 14:09:43,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:43,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 62 [2025-02-08 14:09:43,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:43,861 INFO L124 PetriNetUnfolderBase]: 957/1498 cut-off events. [2025-02-08 14:09:43,862 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 14:09:43,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3041 conditions, 1498 events. 957/1498 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 8879 event pairs, 957 based on Foata normal form. 0/839 useless extension candidates. Maximal degree in co-relation 3037. Up to 1470 conditions per place. [2025-02-08 14:09:43,866 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 23 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2025-02-08 14:09:43,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 27 transitions, 117 flow [2025-02-08 14:09:43,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-02-08 14:09:43,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23655913978494625 [2025-02-08 14:09:43,867 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 73 flow. Second operand 3 states and 44 transitions. [2025-02-08 14:09:43,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 27 transitions, 117 flow [2025-02-08 14:09:43,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 27 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:43,868 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 70 flow [2025-02-08 14:09:43,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2025-02-08 14:09:43,869 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -24 predicate places. [2025-02-08 14:09:43,869 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 70 flow [2025-02-08 14:09:43,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-02-08 14:09:43,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:43,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:09:43,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:09:43,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-08 14:09:43,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:43,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1643361745, now seen corresponding path program 1 times [2025-02-08 14:09:43,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:43,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526136616] [2025-02-08 14:09:43,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:43,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:43,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:09:43,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:09:43,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:43,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:43,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:43,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526136616] [2025-02-08 14:09:43,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526136616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:43,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:43,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:43,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058323145] [2025-02-08 14:09:43,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:43,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:43,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:43,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:43,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:43,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 62 [2025-02-08 14:09:43,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-02-08 14:09:43,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:43,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 62 [2025-02-08 14:09:43,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:43,997 INFO L124 PetriNetUnfolderBase]: 700/1111 cut-off events. [2025-02-08 14:09:43,997 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:09:43,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2264 conditions, 1111 events. 700/1111 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 6261 event pairs, 700 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 2260. Up to 1087 conditions per place. [2025-02-08 14:09:43,999 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 21 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2025-02-08 14:09:44,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 25 transitions, 110 flow [2025-02-08 14:09:44,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-02-08 14:09:44,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22580645161290322 [2025-02-08 14:09:44,000 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 70 flow. Second operand 3 states and 42 transitions. [2025-02-08 14:09:44,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 25 transitions, 110 flow [2025-02-08 14:09:44,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 25 transitions, 109 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:44,001 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 67 flow [2025-02-08 14:09:44,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2025-02-08 14:09:44,002 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -25 predicate places. [2025-02-08 14:09:44,002 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 67 flow [2025-02-08 14:09:44,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-02-08 14:09:44,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:44,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:09:44,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:09:44,002 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-08 14:09:44,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:44,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1643361739, now seen corresponding path program 1 times [2025-02-08 14:09:44,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:44,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314893509] [2025-02-08 14:09:44,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:44,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:44,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:09:44,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:09:44,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:44,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:44,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:44,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314893509] [2025-02-08 14:09:44,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314893509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:44,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:44,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:44,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781424892] [2025-02-08 14:09:44,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:44,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:44,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:44,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:44,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:44,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 62 [2025-02-08 14:09:44,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-02-08 14:09:44,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:44,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 62 [2025-02-08 14:09:44,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:44,116 INFO L124 PetriNetUnfolderBase]: 483/782 cut-off events. [2025-02-08 14:09:44,116 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 14:09:44,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 782 events. 483/782 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4105 event pairs, 483 based on Foata normal form. 0/517 useless extension candidates. Maximal degree in co-relation 1599. Up to 762 conditions per place. [2025-02-08 14:09:44,118 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 19 selfloop transitions, 1 changer transitions 0/23 dead transitions. [2025-02-08 14:09:44,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 23 transitions, 103 flow [2025-02-08 14:09:44,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-02-08 14:09:44,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21505376344086022 [2025-02-08 14:09:44,119 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 67 flow. Second operand 3 states and 40 transitions. [2025-02-08 14:09:44,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 23 transitions, 103 flow [2025-02-08 14:09:44,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 23 transitions, 102 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:44,120 INFO L231 Difference]: Finished difference. Result has 41 places, 23 transitions, 64 flow [2025-02-08 14:09:44,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=41, PETRI_TRANSITIONS=23} [2025-02-08 14:09:44,120 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -26 predicate places. [2025-02-08 14:09:44,120 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 23 transitions, 64 flow [2025-02-08 14:09:44,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-02-08 14:09:44,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:44,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 14:09:44,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 14:09:44,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-02-08 14:09:44,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1643361738, now seen corresponding path program 1 times [2025-02-08 14:09:44,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:44,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297359106] [2025-02-08 14:09:44,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:44,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:09:44,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:09:44,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:44,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:44,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:44,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297359106] [2025-02-08 14:09:44,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297359106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:44,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:44,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 14:09:44,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482567763] [2025-02-08 14:09:44,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:44,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:44,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:44,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:44,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 14:09:44,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 62 [2025-02-08 14:09:44,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 23 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-02-08 14:09:44,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:44,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 62 [2025-02-08 14:09:44,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:44,219 INFO L124 PetriNetUnfolderBase]: 306/511 cut-off events. [2025-02-08 14:09:44,219 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 14:09:44,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 511 events. 306/511 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2452 event pairs, 306 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 1054. Up to 495 conditions per place. [2025-02-08 14:09:44,220 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 0 selfloop transitions, 0 changer transitions 21/21 dead transitions. [2025-02-08 14:09:44,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 21 transitions, 96 flow [2025-02-08 14:09:44,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-02-08 14:09:44,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.20430107526881722 [2025-02-08 14:09:44,221 INFO L175 Difference]: Start difference. First operand has 41 places, 23 transitions, 64 flow. Second operand 3 states and 38 transitions. [2025-02-08 14:09:44,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 21 transitions, 96 flow [2025-02-08 14:09:44,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 21 transitions, 95 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:44,221 INFO L231 Difference]: Finished difference. Result has 40 places, 0 transitions, 0 flow [2025-02-08 14:09:44,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=40, PETRI_TRANSITIONS=0} [2025-02-08 14:09:44,222 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -27 predicate places. [2025-02-08 14:09:44,223 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 0 transitions, 0 flow [2025-02-08 14:09:44,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 75 remaining) [2025-02-08 14:09:44,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 75 remaining) [2025-02-08 14:09:44,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 75 remaining) [2025-02-08 14:09:44,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 75 remaining) [2025-02-08 14:09:44,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 75 remaining) [2025-02-08 14:09:44,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 75 remaining) [2025-02-08 14:09:44,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 75 remaining) [2025-02-08 14:09:44,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 75 remaining) [2025-02-08 14:09:44,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 75 remaining) [2025-02-08 14:09:44,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 75 remaining) [2025-02-08 14:09:44,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 75 remaining) [2025-02-08 14:09:44,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 75 remaining) [2025-02-08 14:09:44,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 14:09:44,229 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:44,234 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 14:09:44,234 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 14:09:44,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 02:09:44 BasicIcfg [2025-02-08 14:09:44,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 14:09:44,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:09:44,240 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:09:44,241 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:09:44,241 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:09:34" (3/4) ... [2025-02-08 14:09:44,242 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 14:09:44,244 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 14:09:44,244 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 14:09:44,244 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 14:09:44,248 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2025-02-08 14:09:44,248 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-02-08 14:09:44,248 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 14:09:44,248 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 14:09:44,248 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 14:09:44,305 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:09:44,306 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 14:09:44,306 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:09:44,306 INFO L158 Benchmark]: Toolchain (without parser) took 11242.22ms. Allocated memory was 167.8MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 133.3MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-02-08 14:09:44,307 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:09:44,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.27ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 121.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:09:44,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.09ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 119.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:09:44,307 INFO L158 Benchmark]: Boogie Preprocessor took 61.31ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 117.4MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:09:44,307 INFO L158 Benchmark]: IcfgBuilder took 976.43ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 60.6MB in the end (delta: 56.9MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. [2025-02-08 14:09:44,307 INFO L158 Benchmark]: TraceAbstraction took 9938.98ms. Allocated memory was 167.8MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 59.6MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-02-08 14:09:44,308 INFO L158 Benchmark]: Witness Printer took 65.52ms. Allocated memory is still 2.8GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:09:44,308 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.27ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 121.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.09ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 119.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.31ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 117.4MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 976.43ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 60.6MB in the end (delta: 56.9MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9938.98ms. Allocated memory was 167.8MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 59.6MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 65.52ms. Allocated memory is still 2.8GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 100]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 101]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 117 locations, 75 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 316 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 316 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 390 IncrementalHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 0 mSDtfsCounter, 390 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=0, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 14:09:44,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE