./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-complex/bounded_buffer.i --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/pthread-complex/bounded_buffer.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6780d9b269575eab8bb01b5a192a21fa771f6fcc4c495cab5abe1df10d7681d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:02:28,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:02:28,458 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:02:28,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:02:28,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:02:28,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:02:28,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:02:28,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:02:28,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:02:28,496 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:02:28,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:02:28,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:02:28,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:02:28,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:02:28,497 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:02:28,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:02:28,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:02:28,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:02:28,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:02:28,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:02:28,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:02:28,499 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:02:28,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:02:28,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:02:28,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:02:28,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:02:28,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:02:28,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:02:28,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:02:28,499 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 -> 6780d9b269575eab8bb01b5a192a21fa771f6fcc4c495cab5abe1df10d7681d5 [2025-02-08 14:02:28,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:02:28,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:02:28,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:02:28,713 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:02:28,713 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:02:28,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-complex/bounded_buffer.i [2025-02-08 14:02:29,972 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13a81aa0f/1761ad22a39549c68a543728a478e1a0/FLAG2f3f6367f [2025-02-08 14:02:30,478 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:02:30,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-complex/bounded_buffer.i [2025-02-08 14:02:30,525 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13a81aa0f/1761ad22a39549c68a543728a478e1a0/FLAG2f3f6367f [2025-02-08 14:02:30,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13a81aa0f/1761ad22a39549c68a543728a478e1a0 [2025-02-08 14:02:30,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:02:30,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:02:30,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:02:30,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:02:30,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:02:30,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:02:30" (1/1) ... [2025-02-08 14:02:30,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78b5920d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:30, skipping insertion in model container [2025-02-08 14:02:30,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:02:30" (1/1) ... [2025-02-08 14:02:30,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:02:31,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:02:31,378 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:02:31,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:02:31,524 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:02:31,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:31 WrapperNode [2025-02-08 14:02:31,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:02:31,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:02:31,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:02:31,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:02:31,532 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:02:31" (1/1) ... [2025-02-08 14:02:31,557 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:02:31" (1/1) ... [2025-02-08 14:02:31,581 INFO L138 Inliner]: procedures = 429, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 470 [2025-02-08 14:02:31,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:02:31,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:02:31,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:02:31,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:02:31,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:31" (1/1) ... [2025-02-08 14:02:31,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:31" (1/1) ... [2025-02-08 14:02:31,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:31" (1/1) ... [2025-02-08 14:02:31,610 INFO L175 MemorySlicer]: Split 78 memory accesses to 6 slices as follows [2, 6, 58, 5, 5, 2]. 74 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 26 writes are split as follows [0, 2, 17, 3, 3, 1]. [2025-02-08 14:02:31,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:31" (1/1) ... [2025-02-08 14:02:31,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:31" (1/1) ... [2025-02-08 14:02:31,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:31" (1/1) ... [2025-02-08 14:02:31,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:31" (1/1) ... [2025-02-08 14:02:31,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:31" (1/1) ... [2025-02-08 14:02:31,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:31" (1/1) ... [2025-02-08 14:02:31,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:02:31,629 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:02:31,629 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:02:31,629 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:02:31,630 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:31" (1/1) ... [2025-02-08 14:02:31,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:02:31,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:02:31,652 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:02:31,654 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:02:31,669 INFO L130 BoogieDeclarations]: Found specification of procedure producer_routine [2025-02-08 14:02:31,669 INFO L138 BoogieDeclarations]: Found implementation of procedure producer_routine [2025-02-08 14:02:31,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:02:31,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:02:31,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:02:31,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:02:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 14:02:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 14:02:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 14:02:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 14:02:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:02:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:02:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 14:02:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 14:02:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 14:02:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 14:02:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 14:02:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 14:02:31,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:02:31,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure consumer_routine [2025-02-08 14:02:31,671 INFO L138 BoogieDeclarations]: Found implementation of procedure consumer_routine [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 14:02:31,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 14:02:31,672 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:02:31,795 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:02:31,796 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:02:31,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631: havoc #t~ret120#1; [2025-02-08 14:02:31,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-1: havoc #t~mem119#1.base, #t~mem119#1.offset; [2025-02-08 14:02:31,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-2: ~status~6#1 := #t~ret120#1; [2025-02-08 14:02:31,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-3: assume { :end_inline_bounded_buf_put } true;assume -2147483648 <= #t~ret120#1 && #t~ret120#1 <= 2147483647; [2025-02-08 14:02:31,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-4: havoc bounded_buf_put_#in~bbuf#1.base, bounded_buf_put_#in~bbuf#1.offset, bounded_buf_put_#in~item#1.base, bounded_buf_put_#in~item#1.offset; [2025-02-08 14:02:31,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-5: havoc bounded_buf_put_#t~mem60#1, bounded_buf_put_#t~short61#1, bounded_buf_put_#t~ret62#1, bounded_buf_put_#t~mem63#1, bounded_buf_put_#t~mem64#1, bounded_buf_put_#t~mem65#1, bounded_buf_put_#t~mem66#1, bounded_buf_put_#t~post67#1, bounded_buf_put_#t~mem68#1, bounded_buf_put_#t~mem69#1, bounded_buf_put_#t~mem70#1, bounded_buf_put_#t~ret71#1, bounded_buf_put_#t~ret72#1, bounded_buf_put_#t~mem73#1, bounded_buf_put_#t~post74#1, bounded_buf_put_#t~mem76#1.base, bounded_buf_put_#t~mem76#1.offset, bounded_buf_put_#t~mem75#1, bounded_buf_put_#t~mem77#1, bounded_buf_put_#t~mem78#1, bounded_buf_put_#t~mem79#1, bounded_buf_put_#t~ret80#1, bounded_buf_put_~bbuf#1.base, bounded_buf_put_~bbuf#1.offset, bounded_buf_put_~item#1.base, bounded_buf_put_~item#1.offset, bounded_buf_put_~status~2#1, bounded_buf_put_~status1~1#1, bounded_buf_put_~status2~1#1; [2025-02-08 14:02:31,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-6: #t~ret120#1 := bounded_buf_put_#res#1; [2025-02-08 14:02:31,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1632: assume 0 != ~status~6#1; [2025-02-08 14:02:31,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1632: assume !(0 != ~status~6#1); [2025-02-08 14:02:31,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1627-1: havoc #t~post122#1; [2025-02-08 14:02:31,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1627-2: assume 1 + #t~post122#1 <= 2147483647; [2025-02-08 14:02:31,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1627-2: assume !(1 + #t~post122#1 <= 2147483647); [2025-02-08 14:02:31,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1627-3: ~i~1#1 := 1 + #t~post122#1; [2025-02-08 14:02:31,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1627-4: assume 1 + #t~post122#1 >= -2147483648; [2025-02-08 14:02:31,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1627-4: assume !(1 + #t~post122#1 >= -2147483648); [2025-02-08 14:02:31,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1627-5: #t~post122#1 := ~i~1#1; [2025-02-08 14:02:31,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636: assume true; [2025-02-08 14:02:31,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636: assume !true; [2025-02-08 14:02:31,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636-1: assume false; [2025-02-08 14:02:31,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636-1: assume !false; [2025-02-08 14:02:31,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636-2: havoc #t~nondet121#1; [2025-02-08 14:02:32,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654: havoc #t~mem125#1.base, #t~mem125#1.offset; [2025-02-08 14:02:32,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654-1: havoc #t~mem125#1.base, #t~mem125#1.offset; [2025-02-08 14:02:32,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654-2: ~ch~1#1 := (if (#t~mem125#1.base + #t~mem125#1.offset) % 256 <= 127 then (#t~mem125#1.base + #t~mem125#1.offset) % 256 else (#t~mem125#1.base + #t~mem125#1.offset) % 256 - 256); [2025-02-08 14:02:32,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654-3: SUMMARY for call #t~mem125#1.base, #t~mem125#1.offset := read~$Pointer$#5(~#temp~1#1.base, ~#temp~1#1.offset, 4); srcloc: null [2025-02-08 14:02:32,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646: havoc ~#temp~1#1.base, ~#temp~1#1.offset; [2025-02-08 14:02:32,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646-1: SUMMARY for call ULTIMATE.dealloc(~#temp~1#1.base, ~#temp~1#1.offset); srcloc: null [2025-02-08 14:02:32,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647-1: havoc #t~post127#1; [2025-02-08 14:02:32,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647-2: assume 1 + #t~post127#1 <= 2147483647; [2025-02-08 14:02:32,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647-2: assume !(1 + #t~post127#1 <= 2147483647); [2025-02-08 14:02:32,118 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647-3: ~i~2#1 := 1 + #t~post127#1; [2025-02-08 14:02:32,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647-4: assume 1 + #t~post127#1 >= -2147483648; [2025-02-08 14:02:32,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647-4: assume !(1 + #t~post127#1 >= -2147483648); [2025-02-08 14:02:32,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647-5: #t~post127#1 := ~i~2#1; [2025-02-08 14:02:32,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1657: assume true; [2025-02-08 14:02:32,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1657: assume !true; [2025-02-08 14:02:32,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1657-1: assume false; [2025-02-08 14:02:32,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1657-1: assume !false; [2025-02-08 14:02:32,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1657-2: havoc #t~nondet126#1; [2025-02-08 14:02:32,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649: havoc #t~ret124#1; [2025-02-08 14:02:32,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649-1: havoc #t~mem123#1.base, #t~mem123#1.offset; [2025-02-08 14:02:32,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649-2: ~status~7#1 := #t~ret124#1; [2025-02-08 14:02:32,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649-3: assume { :end_inline_bounded_buf_get } true;assume -2147483648 <= #t~ret124#1 && #t~ret124#1 <= 2147483647; [2025-02-08 14:02:32,119 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649-4: havoc bounded_buf_get_#in~bbuf#1.base, bounded_buf_get_#in~bbuf#1.offset, bounded_buf_get_#in~item#1.base, bounded_buf_get_#in~item#1.offset; [2025-02-08 14:02:32,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649-5: havoc bounded_buf_get_#t~mem81#1, bounded_buf_get_#t~short82#1, bounded_buf_get_#t~ret83#1, bounded_buf_get_#t~mem84#1, bounded_buf_get_#t~mem85#1, bounded_buf_get_#t~mem86#1, bounded_buf_get_#t~post87#1, bounded_buf_get_#t~mem88#1, bounded_buf_get_#t~mem89#1, bounded_buf_get_#t~ret90#1, bounded_buf_get_#t~ret91#1, bounded_buf_get_#t~mem92#1, bounded_buf_get_#t~post93#1, bounded_buf_get_#t~ret94#1, bounded_buf_get_#t~ret95#1, bounded_buf_get_#t~mem96#1, bounded_buf_get_#t~mem97#1, bounded_buf_get_#t~mem99#1.base, bounded_buf_get_#t~mem99#1.offset, bounded_buf_get_#t~mem98#1, bounded_buf_get_#t~mem100#1.base, bounded_buf_get_#t~mem100#1.offset, bounded_buf_get_#t~mem101#1, bounded_buf_get_#t~mem102#1, bounded_buf_get_#t~mem103#1, bounded_buf_get_#t~ret104#1, bounded_buf_get_~bbuf#1.base, bounded_buf_get_~bbuf#1.offset, bounded_buf_get_~item#1.base, bounded_buf_get_~item#1.offset, bounded_buf_get_~status~3#1, bounded_buf_get_~status1~2#1, bounded_buf_get_~status2~2#1; [2025-02-08 14:02:32,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649-6: #t~ret124#1 := bounded_buf_get_#res#1; [2025-02-08 14:02:32,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1650: assume 0 != ~status~7#1; [2025-02-08 14:02:32,120 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1650: assume !(0 != ~status~7#1); [2025-02-08 14:02:32,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1663: havoc main_~#producers~0#1.base, main_~#producers~0#1.offset; [2025-02-08 14:02:32,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1663-1: SUMMARY for call ULTIMATE.dealloc(main_~#producers~0#1.base, main_~#producers~0#1.offset); srcloc: null [2025-02-08 14:02:32,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1664: havoc main_~#consumers~0#1.base, main_~#consumers~0#1.offset; [2025-02-08 14:02:32,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1664-1: SUMMARY for call ULTIMATE.dealloc(main_~#consumers~0#1.base, main_~#consumers~0#1.offset); srcloc: null [2025-02-08 14:02:32,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1666: havoc main_~#buffer~0#1.base, main_~#buffer~0#1.offset; [2025-02-08 14:02:32,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1666-1: SUMMARY for call ULTIMATE.dealloc(main_~#buffer~0#1.base, main_~#buffer~0#1.offset); srcloc: null [2025-02-08 14:02:32,392 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:02:32,392 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:02:32,656 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:02:32,656 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:02:32,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:02:32 BoogieIcfgContainer [2025-02-08 14:02:32,657 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:02:32,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:02:32,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:02:32,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:02:32,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:02:30" (1/3) ... [2025-02-08 14:02:32,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704f71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:02:32, skipping insertion in model container [2025-02-08 14:02:32,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:02:31" (2/3) ... [2025-02-08 14:02:32,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704f71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:02:32, skipping insertion in model container [2025-02-08 14:02:32,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:02:32" (3/3) ... [2025-02-08 14:02:32,663 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_buffer.i [2025-02-08 14:02:32,673 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:02:32,674 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_buffer.i that has 3 procedures, 106 locations, 1 initial locations, 13 loop locations, and 20 error locations. [2025-02-08 14:02:32,674 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:02:32,738 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 14:02:32,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 136 transitions, 292 flow [2025-02-08 14:02:32,862 INFO L124 PetriNetUnfolderBase]: 66/328 cut-off events. [2025-02-08 14:02:32,863 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 14:02:32,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 328 events. 66/328 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1584 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 169. Up to 16 conditions per place. [2025-02-08 14:02:32,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 136 transitions, 292 flow [2025-02-08 14:02:32,871 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 131 transitions, 282 flow [2025-02-08 14:02:32,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:02:32,882 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;@26348185, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:02:32,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 14:02:32,892 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:02:32,893 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-02-08 14:02:32,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:02:32,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:32,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:32,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 14:02:32,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash -583667844, now seen corresponding path program 1 times [2025-02-08 14:02:32,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:32,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298496396] [2025-02-08 14:02:32,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:32,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:32,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:02:33,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:02:33,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:33,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:33,468 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:02:33,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:33,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298496396] [2025-02-08 14:02:33,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298496396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:33,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:33,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:02:33,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762865534] [2025-02-08 14:02:33,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:33,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:02:33,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:33,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:02:33,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:02:33,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 136 [2025-02-08 14:02:33,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 131 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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:02:33,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:33,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 136 [2025-02-08 14:02:33,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:38,173 INFO L124 PetriNetUnfolderBase]: 31776/49912 cut-off events. [2025-02-08 14:02:38,174 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2025-02-08 14:02:38,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93099 conditions, 49912 events. 31776/49912 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 346918 event pairs, 20601 based on Foata normal form. 19/36583 useless extension candidates. Maximal degree in co-relation 89074. Up to 38425 conditions per place. [2025-02-08 14:02:38,414 INFO L140 encePairwiseOnDemand]: 119/136 looper letters, 164 selfloop transitions, 10 changer transitions 1/203 dead transitions. [2025-02-08 14:02:38,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 203 transitions, 788 flow [2025-02-08 14:02:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:02:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:02:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 324 transitions. [2025-02-08 14:02:38,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4764705882352941 [2025-02-08 14:02:38,429 INFO L175 Difference]: Start difference. First operand has 111 places, 131 transitions, 282 flow. Second operand 5 states and 324 transitions. [2025-02-08 14:02:38,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 203 transitions, 788 flow [2025-02-08 14:02:38,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 203 transitions, 788 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:02:38,447 INFO L231 Difference]: Finished difference. Result has 116 places, 129 transitions, 324 flow [2025-02-08 14:02:38,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=116, PETRI_TRANSITIONS=129} [2025-02-08 14:02:38,453 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 5 predicate places. [2025-02-08 14:02:38,454 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 129 transitions, 324 flow [2025-02-08 14:02:38,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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:02:38,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:38,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:38,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:02:38,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 14:02:38,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:38,456 INFO L85 PathProgramCache]: Analyzing trace with hash -918105458, now seen corresponding path program 1 times [2025-02-08 14:02:38,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:38,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949583893] [2025-02-08 14:02:38,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:38,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:38,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:02:38,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:02:38,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:38,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:38,612 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:02:38,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:38,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949583893] [2025-02-08 14:02:38,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949583893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:38,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:38,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:02:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656746607] [2025-02-08 14:02:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:38,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:02:38,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:38,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:02:38,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:02:38,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 136 [2025-02-08 14:02:38,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 129 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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:02:38,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:38,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 136 [2025-02-08 14:02:38,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:39,732 INFO L124 PetriNetUnfolderBase]: 5686/9178 cut-off events. [2025-02-08 14:02:39,732 INFO L125 PetriNetUnfolderBase]: For 1975/1975 co-relation queries the response was YES. [2025-02-08 14:02:39,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19483 conditions, 9178 events. 5686/9178 cut-off events. For 1975/1975 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 54528 event pairs, 2952 based on Foata normal form. 479/8122 useless extension candidates. Maximal degree in co-relation 18720. Up to 5351 conditions per place. [2025-02-08 14:02:39,774 INFO L140 encePairwiseOnDemand]: 126/136 looper letters, 131 selfloop transitions, 9 changer transitions 7/176 dead transitions. [2025-02-08 14:02:39,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 176 transitions, 710 flow [2025-02-08 14:02:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:02:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:02:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2025-02-08 14:02:39,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49816176470588236 [2025-02-08 14:02:39,777 INFO L175 Difference]: Start difference. First operand has 116 places, 129 transitions, 324 flow. Second operand 4 states and 271 transitions. [2025-02-08 14:02:39,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 176 transitions, 710 flow [2025-02-08 14:02:39,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 176 transitions, 699 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:02:39,789 INFO L231 Difference]: Finished difference. Result has 115 places, 119 transitions, 301 flow [2025-02-08 14:02:39,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=115, PETRI_TRANSITIONS=119} [2025-02-08 14:02:39,790 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 4 predicate places. [2025-02-08 14:02:39,790 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 119 transitions, 301 flow [2025-02-08 14:02:39,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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:02:39,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:39,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:39,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:02:39,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 14:02:39,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash -913833029, now seen corresponding path program 1 times [2025-02-08 14:02:39,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:39,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477070878] [2025-02-08 14:02:39,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:39,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:39,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:02:39,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:02:39,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:39,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:39,982 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:02:39,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:39,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477070878] [2025-02-08 14:02:39,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477070878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:39,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:39,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:02:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414767995] [2025-02-08 14:02:39,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:39,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:02:39,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:39,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:02:39,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:02:39,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 136 [2025-02-08 14:02:40,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 119 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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:02:40,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:40,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 136 [2025-02-08 14:02:40,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:02:42,002 INFO L124 PetriNetUnfolderBase]: 5681/9184 cut-off events. [2025-02-08 14:02:42,003 INFO L125 PetriNetUnfolderBase]: For 1545/1545 co-relation queries the response was YES. [2025-02-08 14:02:42,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19956 conditions, 9184 events. 5681/9184 cut-off events. For 1545/1545 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 54568 event pairs, 2934 based on Foata normal form. 19/7694 useless extension candidates. Maximal degree in co-relation 19191. Up to 5309 conditions per place. [2025-02-08 14:02:42,044 INFO L140 encePairwiseOnDemand]: 125/136 looper letters, 151 selfloop transitions, 10 changer transitions 1/190 dead transitions. [2025-02-08 14:02:42,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 190 transitions, 773 flow [2025-02-08 14:02:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:02:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:02:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 303 transitions. [2025-02-08 14:02:42,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4455882352941177 [2025-02-08 14:02:42,046 INFO L175 Difference]: Start difference. First operand has 115 places, 119 transitions, 301 flow. Second operand 5 states and 303 transitions. [2025-02-08 14:02:42,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 190 transitions, 773 flow [2025-02-08 14:02:42,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 190 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:02:42,057 INFO L231 Difference]: Finished difference. Result has 114 places, 118 transitions, 308 flow [2025-02-08 14:02:42,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=114, PETRI_TRANSITIONS=118} [2025-02-08 14:02:42,058 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, 3 predicate places. [2025-02-08 14:02:42,058 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 118 transitions, 308 flow [2025-02-08 14:02:42,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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:02:42,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:42,058 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:42,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:02:42,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 14:02:42,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2020179011, now seen corresponding path program 1 times [2025-02-08 14:02:42,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:42,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032066174] [2025-02-08 14:02:42,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:42,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:42,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:02:42,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:02:42,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:42,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:02:42,153 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:02:42,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:02:42,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:02:42,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:42,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:02:42,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:02:42,254 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:02:42,256 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-02-08 14:02:42,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-02-08 14:02:42,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-02-08 14:02:42,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-02-08 14:02:42,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-02-08 14:02:42,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-02-08 14:02:42,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-02-08 14:02:42,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-02-08 14:02:42,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-02-08 14:02:42,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-02-08 14:02:42,257 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-02-08 14:02:42,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-02-08 14:02:42,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-02-08 14:02:42,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-02-08 14:02:42,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-02-08 14:02:42,258 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 16 remaining) [2025-02-08 14:02:42,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:02:42,258 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 14:02:42,264 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:02:42,264 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 14:02:42,331 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-02-08 14:02:42,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 193 transitions, 430 flow [2025-02-08 14:02:42,402 INFO L124 PetriNetUnfolderBase]: 253/1183 cut-off events. [2025-02-08 14:02:42,402 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-02-08 14:02:42,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 1183 events. 253/1183 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7851 event pairs, 1 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 657. Up to 64 conditions per place. [2025-02-08 14:02:42,411 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 193 transitions, 430 flow [2025-02-08 14:02:42,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 188 transitions, 420 flow [2025-02-08 14:02:42,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:02:42,418 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;@26348185, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:02:42,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 14:02:42,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:02:42,421 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-02-08 14:02:42,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:02:42,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:02:42,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:02:42,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 14:02:42,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:02:42,422 INFO L85 PathProgramCache]: Analyzing trace with hash 144865808, now seen corresponding path program 1 times [2025-02-08 14:02:42,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:02:42,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906627365] [2025-02-08 14:02:42,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:02:42,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:02:42,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:02:42,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:02:42,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:02:42,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:02:42,567 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:02:42,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:02:42,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906627365] [2025-02-08 14:02:42,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906627365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:02:42,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:02:42,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:02:42,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375351235] [2025-02-08 14:02:42,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:02:42,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:02:42,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:02:42,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:02:42,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:02:42,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 193 [2025-02-08 14:02:42,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 188 transitions, 420 flow. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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:02:42,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:02:42,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 193 [2025-02-08 14:02:42,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand