./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.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/goblint-regression/28-race_reach_01-simple_racing.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 eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:04:48,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:04:48,678 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:04:48,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:04:48,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:04:48,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:04:48,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:04:48,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:04:48,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:04:48,696 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:04:48,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:04:48,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:04:48,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:04:48,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:04:48,696 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:04:48,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:04:48,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:04:48,696 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:04:48,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:04:48,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:04:48,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:04:48,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:04:48,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:04:48,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:04:48,697 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:04:48,697 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:04:48,697 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:04:48,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:04:48,697 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:04:48,697 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:04:48,697 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:04:48,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:04:48,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:04:48,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:04:48,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:04:48,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:04:48,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:04:48,699 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:04:48,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:04:48,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:04:48,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:04:48,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:04:48,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:04:48,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:04:48,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:04:48,699 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 -> eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 [2025-02-08 14:04:48,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:04:48,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:04:48,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:04:48,911 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:04:48,911 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:04:48,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-02-08 14:04:50,079 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0d598b2f/30735ba6d279490399f070325f5b9818/FLAG35639ea25 [2025-02-08 14:04:50,354 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:04:50,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-02-08 14:04:50,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0d598b2f/30735ba6d279490399f070325f5b9818/FLAG35639ea25 [2025-02-08 14:04:50,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0d598b2f/30735ba6d279490399f070325f5b9818 [2025-02-08 14:04:50,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:04:50,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:04:50,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:04:50,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:04:50,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:04:50,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:04:50" (1/1) ... [2025-02-08 14:04:50,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57efafa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:50, skipping insertion in model container [2025-02-08 14:04:50,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:04:50" (1/1) ... [2025-02-08 14:04:50,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:04:50,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:04:50,673 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:04:50,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:04:50,742 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:04:50,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:50 WrapperNode [2025-02-08 14:04:50,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:04:50,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:04:50,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:04:50,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:04:50,749 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:04:50" (1/1) ... [2025-02-08 14:04:50,758 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:04:50" (1/1) ... [2025-02-08 14:04:50,776 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2025-02-08 14:04:50,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:04:50,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:04:50,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:04:50,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:04:50,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:50" (1/1) ... [2025-02-08 14:04:50,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:50" (1/1) ... [2025-02-08 14:04:50,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:50" (1/1) ... [2025-02-08 14:04:50,796 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2025-02-08 14:04:50,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:50" (1/1) ... [2025-02-08 14:04:50,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:50" (1/1) ... [2025-02-08 14:04:50,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:50" (1/1) ... [2025-02-08 14:04:50,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:50" (1/1) ... [2025-02-08 14:04:50,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:50" (1/1) ... [2025-02-08 14:04:50,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:50" (1/1) ... [2025-02-08 14:04:50,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:04:50,805 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:04:50,805 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:04:50,805 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:04:50,806 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:50" (1/1) ... [2025-02-08 14:04:50,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:04:50,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:04:50,838 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:04:50,845 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:04:50,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:04:50,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:04:50,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 14:04:50,865 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 14:04:50,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:04:50,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:04:50,866 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:04:50,949 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:04:50,950 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:04:51,109 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 14:04:51,110 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 14:04:51,163 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:04:51,164 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:04:51,257 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:04:51,257 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:04:51,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:04:51 BoogieIcfgContainer [2025-02-08 14:04:51,257 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:04:51,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:04:51,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:04:51,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:04:51,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:04:50" (1/3) ... [2025-02-08 14:04:51,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e9b109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:04:51, skipping insertion in model container [2025-02-08 14:04:51,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:50" (2/3) ... [2025-02-08 14:04:51,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e9b109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:04:51, skipping insertion in model container [2025-02-08 14:04:51,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:04:51" (3/3) ... [2025-02-08 14:04:51,265 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2025-02-08 14:04:51,277 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:04:51,279 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_01-simple_racing.i that has 2 procedures, 54 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-02-08 14:04:51,280 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:04:51,321 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 14:04:51,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 63 transitions, 133 flow [2025-02-08 14:04:51,385 INFO L124 PetriNetUnfolderBase]: 11/79 cut-off events. [2025-02-08 14:04:51,388 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:04:51,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 79 events. 11/79 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 241 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2025-02-08 14:04:51,392 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 63 transitions, 133 flow [2025-02-08 14:04:51,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 62 transitions, 131 flow [2025-02-08 14:04:51,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:04:51,415 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;@1567998, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:04:51,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 14:04:51,423 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:04:51,423 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 14:04:51,424 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:04:51,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:51,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:04:51,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:04:51,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash 306705670, now seen corresponding path program 1 times [2025-02-08 14:04:51,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:51,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186414235] [2025-02-08 14:04:51,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:51,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:51,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:04:51,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:04:51,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:51,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:51,619 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:04:51,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:51,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186414235] [2025-02-08 14:04:51,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186414235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:51,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:51,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:04:51,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930231675] [2025-02-08 14:04:51,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:51,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:04:51,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:51,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:04:51,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:04:51,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 63 [2025-02-08 14:04:51,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:04:51,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:51,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 63 [2025-02-08 14:04:51,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:04:51,808 INFO L124 PetriNetUnfolderBase]: 132/382 cut-off events. [2025-02-08 14:04:51,808 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:04:51,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 382 events. 132/382 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1865 event pairs, 20 based on Foata normal form. 114/459 useless extension candidates. Maximal degree in co-relation 650. Up to 255 conditions per place. [2025-02-08 14:04:51,812 INFO L140 encePairwiseOnDemand]: 49/63 looper letters, 46 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-02-08 14:04:51,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 255 flow [2025-02-08 14:04:51,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:04:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:04:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2025-02-08 14:04:51,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2025-02-08 14:04:51,825 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 131 flow. Second operand 4 states and 176 transitions. [2025-02-08 14:04:51,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 255 flow [2025-02-08 14:04:51,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 75 transitions, 255 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:04:51,835 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 121 flow [2025-02-08 14:04:51,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2025-02-08 14:04:51,841 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2025-02-08 14:04:51,841 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 121 flow [2025-02-08 14:04:51,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:04:51,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:51,842 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:04:51,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:04:51,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:04:51,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:51,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1673409030, now seen corresponding path program 1 times [2025-02-08 14:04:51,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:51,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203406508] [2025-02-08 14:04:51,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:51,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:51,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:04:51,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:04:51,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:51,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:04:51,883 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:04:51,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:04:51,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:04:51,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:51,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:04:51,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:04:51,920 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:04:51,922 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 14:04:51,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-08 14:04:51,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-08 14:04:51,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-08 14:04:51,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-08 14:04:51,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-08 14:04:51,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-08 14:04:51,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-08 14:04:51,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-08 14:04:51,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-08 14:04:51,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-08 14:04:51,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-08 14:04:51,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-08 14:04:51,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:04:51,926 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 14:04:51,929 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:04:51,929 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 14:04:51,950 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:04:51,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 98 transitions, 212 flow [2025-02-08 14:04:51,977 INFO L124 PetriNetUnfolderBase]: 21/149 cut-off events. [2025-02-08 14:04:51,977 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:04:51,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 149 events. 21/149 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 565 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 96. Up to 6 conditions per place. [2025-02-08 14:04:51,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 98 transitions, 212 flow [2025-02-08 14:04:51,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 98 transitions, 212 flow [2025-02-08 14:04:51,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:04:51,980 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;@1567998, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:04:51,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-08 14:04:51,982 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:04:51,982 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 14:04:51,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:04:51,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:51,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:04:51,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:04:51,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:51,983 INFO L85 PathProgramCache]: Analyzing trace with hash 400259273, now seen corresponding path program 1 times [2025-02-08 14:04:51,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:51,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915881102] [2025-02-08 14:04:51,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:51,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:51,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:04:51,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:04:51,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:51,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:52,050 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:04:52,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:52,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915881102] [2025-02-08 14:04:52,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915881102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:52,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:52,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:04:52,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452340659] [2025-02-08 14:04:52,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:52,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:04:52,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:52,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:04:52,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:04:52,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 98 [2025-02-08 14:04:52,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 98 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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:04:52,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:52,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 98 [2025-02-08 14:04:52,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:04:52,871 INFO L124 PetriNetUnfolderBase]: 4028/9087 cut-off events. [2025-02-08 14:04:52,872 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 14:04:52,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15565 conditions, 9087 events. 4028/9087 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 78032 event pairs, 3802 based on Foata normal form. 2490/10578 useless extension candidates. Maximal degree in co-relation 12188. Up to 6374 conditions per place. [2025-02-08 14:04:52,926 INFO L140 encePairwiseOnDemand]: 78/98 looper letters, 64 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-02-08 14:04:52,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 109 transitions, 368 flow [2025-02-08 14:04:52,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:04:52,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:04:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2025-02-08 14:04:52,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2025-02-08 14:04:52,930 INFO L175 Difference]: Start difference. First operand has 87 places, 98 transitions, 212 flow. Second operand 4 states and 264 transitions. [2025-02-08 14:04:52,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 109 transitions, 368 flow [2025-02-08 14:04:52,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 109 transitions, 368 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:04:52,934 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 208 flow [2025-02-08 14:04:52,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2025-02-08 14:04:52,935 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 5 predicate places. [2025-02-08 14:04:52,935 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 208 flow [2025-02-08 14:04:52,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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:04:52,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:52,936 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:04:52,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:04:52,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:04:52,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:52,937 INFO L85 PathProgramCache]: Analyzing trace with hash -931867129, now seen corresponding path program 1 times [2025-02-08 14:04:52,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:52,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460459938] [2025-02-08 14:04:52,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:52,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:52,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:04:52,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:04:52,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:52,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:53,019 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:04:53,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:53,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460459938] [2025-02-08 14:04:53,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460459938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:53,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:53,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:04:53,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535045114] [2025-02-08 14:04:53,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:53,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:04:53,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:53,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:04:53,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:04:53,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 98 [2025-02-08 14:04:53,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 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:04:53,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:53,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 98 [2025-02-08 14:04:53,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:04:53,762 INFO L124 PetriNetUnfolderBase]: 3764/7668 cut-off events. [2025-02-08 14:04:53,763 INFO L125 PetriNetUnfolderBase]: For 678/678 co-relation queries the response was YES. [2025-02-08 14:04:53,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14378 conditions, 7668 events. 3764/7668 cut-off events. For 678/678 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 62023 event pairs, 622 based on Foata normal form. 144/7282 useless extension candidates. Maximal degree in co-relation 13008. Up to 4012 conditions per place. [2025-02-08 14:04:53,800 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 104 selfloop transitions, 6 changer transitions 0/152 dead transitions. [2025-02-08 14:04:53,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 152 transitions, 558 flow [2025-02-08 14:04:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:04:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:04:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 363 transitions. [2025-02-08 14:04:53,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6173469387755102 [2025-02-08 14:04:53,802 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 208 flow. Second operand 6 states and 363 transitions. [2025-02-08 14:04:53,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 152 transitions, 558 flow [2025-02-08 14:04:53,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 152 transitions, 556 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:04:53,805 INFO L231 Difference]: Finished difference. Result has 95 places, 85 transitions, 214 flow [2025-02-08 14:04:53,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=95, PETRI_TRANSITIONS=85} [2025-02-08 14:04:53,806 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 8 predicate places. [2025-02-08 14:04:53,806 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 85 transitions, 214 flow [2025-02-08 14:04:53,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 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:04:53,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:53,806 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:04:53,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:04:53,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:04:53,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:53,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1176890403, now seen corresponding path program 1 times [2025-02-08 14:04:53,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:53,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882875204] [2025-02-08 14:04:53,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:53,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:53,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:04:53,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:04:53,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:53,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:53,862 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:04:53,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:53,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882875204] [2025-02-08 14:04:53,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882875204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:53,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:53,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:04:53,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161689732] [2025-02-08 14:04:53,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:53,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:04:53,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:53,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:04:53,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:04:53,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 98 [2025-02-08 14:04:53,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 85 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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:04:53,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:53,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 98 [2025-02-08 14:04:53,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:04:54,365 INFO L124 PetriNetUnfolderBase]: 3500/6908 cut-off events. [2025-02-08 14:04:54,366 INFO L125 PetriNetUnfolderBase]: For 1169/1169 co-relation queries the response was YES. [2025-02-08 14:04:54,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13523 conditions, 6908 events. 3500/6908 cut-off events. For 1169/1169 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 53714 event pairs, 252 based on Foata normal form. 144/6717 useless extension candidates. Maximal degree in co-relation 9864. Up to 4443 conditions per place. [2025-02-08 14:04:54,399 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 81 selfloop transitions, 6 changer transitions 0/129 dead transitions. [2025-02-08 14:04:54,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 129 transitions, 474 flow [2025-02-08 14:04:54,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:04:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:04:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2025-02-08 14:04:54,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6479591836734694 [2025-02-08 14:04:54,401 INFO L175 Difference]: Start difference. First operand has 95 places, 85 transitions, 214 flow. Second operand 4 states and 254 transitions. [2025-02-08 14:04:54,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 129 transitions, 474 flow [2025-02-08 14:04:54,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 129 transitions, 458 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 14:04:54,407 INFO L231 Difference]: Finished difference. Result has 93 places, 85 transitions, 214 flow [2025-02-08 14:04:54,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2025-02-08 14:04:54,407 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 6 predicate places. [2025-02-08 14:04:54,407 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 214 flow [2025-02-08 14:04:54,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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:04:54,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:54,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:04:54,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:04:54,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:04:54,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:54,408 INFO L85 PathProgramCache]: Analyzing trace with hash -56843564, now seen corresponding path program 1 times [2025-02-08 14:04:54,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:54,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429153297] [2025-02-08 14:04:54,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:54,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:54,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:04:54,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:04:54,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:54,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:54,463 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:04:54,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:54,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429153297] [2025-02-08 14:04:54,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429153297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:54,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:54,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:04:54,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595224295] [2025-02-08 14:04:54,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:54,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:04:54,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:54,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:04:54,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:04:54,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 98 [2025-02-08 14:04:54,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:04:54,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:54,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 98 [2025-02-08 14:04:54,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:04:55,201 INFO L124 PetriNetUnfolderBase]: 5385/11508 cut-off events. [2025-02-08 14:04:55,201 INFO L125 PetriNetUnfolderBase]: For 1535/1535 co-relation queries the response was YES. [2025-02-08 14:04:55,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21012 conditions, 11508 events. 5385/11508 cut-off events. For 1535/1535 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 101266 event pairs, 1446 based on Foata normal form. 209/10724 useless extension candidates. Maximal degree in co-relation 16966. Up to 5441 conditions per place. [2025-02-08 14:04:55,247 INFO L140 encePairwiseOnDemand]: 89/98 looper letters, 119 selfloop transitions, 12 changer transitions 0/173 dead transitions. [2025-02-08 14:04:55,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 173 transitions, 711 flow [2025-02-08 14:04:55,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:04:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:04:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 346 transitions. [2025-02-08 14:04:55,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7061224489795919 [2025-02-08 14:04:55,249 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 214 flow. Second operand 5 states and 346 transitions. [2025-02-08 14:04:55,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 173 transitions, 711 flow [2025-02-08 14:04:55,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 173 transitions, 695 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:04:55,252 INFO L231 Difference]: Finished difference. Result has 99 places, 96 transitions, 300 flow [2025-02-08 14:04:55,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=300, PETRI_PLACES=99, PETRI_TRANSITIONS=96} [2025-02-08 14:04:55,252 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, 12 predicate places. [2025-02-08 14:04:55,252 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 300 flow [2025-02-08 14:04:55,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:04:55,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:55,253 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 14:04:55,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:04:55,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:04:55,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:55,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1415291304, now seen corresponding path program 1 times [2025-02-08 14:04:55,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:55,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391994245] [2025-02-08 14:04:55,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:55,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:55,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:04:55,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:04:55,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:55,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:04:55,270 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:04:55,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:04:55,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:04:55,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:55,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:04:55,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:04:55,287 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:04:55,287 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-08 14:04:55,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-02-08 14:04:55,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-02-08 14:04:55,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-02-08 14:04:55,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-02-08 14:04:55,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-02-08 14:04:55,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-02-08 14:04:55,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-02-08 14:04:55,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-02-08 14:04:55,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-02-08 14:04:55,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-02-08 14:04:55,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-02-08 14:04:55,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-02-08 14:04:55,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-02-08 14:04:55,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-02-08 14:04:55,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-02-08 14:04:55,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-02-08 14:04:55,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:04:55,290 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 14:04:55,290 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:04:55,290 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 14:04:55,316 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:04:55,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 133 transitions, 293 flow [2025-02-08 14:04:55,341 INFO L124 PetriNetUnfolderBase]: 34/238 cut-off events. [2025-02-08 14:04:55,342 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 14:04:55,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 238 events. 34/238 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1004 event pairs, 1 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 164. Up to 12 conditions per place. [2025-02-08 14:04:55,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 133 transitions, 293 flow [2025-02-08 14:04:55,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 133 transitions, 293 flow [2025-02-08 14:04:55,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:04:55,346 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;@1567998, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:04:55,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-08 14:04:55,347 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:04:55,347 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-08 14:04:55,347 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:04:55,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:55,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:04:55,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:04:55,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:55,348 INFO L85 PathProgramCache]: Analyzing trace with hash 527213551, now seen corresponding path program 1 times [2025-02-08 14:04:55,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:55,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307711878] [2025-02-08 14:04:55,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:55,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:55,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:04:55,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:04:55,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:55,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:55,386 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:04:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:55,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307711878] [2025-02-08 14:04:55,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307711878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:55,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:55,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:04:55,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243579978] [2025-02-08 14:04:55,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:55,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:04:55,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:55,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:04:55,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:04:55,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 133 [2025-02-08 14:04:55,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 133 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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:04:55,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:55,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 133 [2025-02-08 14:04:55,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:02,792 INFO L124 PetriNetUnfolderBase]: 76325/139769 cut-off events. [2025-02-08 14:05:02,792 INFO L125 PetriNetUnfolderBase]: For 1627/1627 co-relation queries the response was YES. [2025-02-08 14:05:03,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246866 conditions, 139769 events. 76325/139769 cut-off events. For 1627/1627 co-relation queries the response was YES. Maximal size of possible extension queue 3162. Compared 1484090 event pairs, 73710 based on Foata normal form. 44347/170848 useless extension candidates. Maximal degree in co-relation 126395. Up to 105935 conditions per place. [2025-02-08 14:05:03,534 INFO L140 encePairwiseOnDemand]: 107/133 looper letters, 77 selfloop transitions, 3 changer transitions 0/138 dead transitions. [2025-02-08 14:05:03,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 138 transitions, 463 flow [2025-02-08 14:05:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2025-02-08 14:05:03,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6522556390977443 [2025-02-08 14:05:03,535 INFO L175 Difference]: Start difference. First operand has 117 places, 133 transitions, 293 flow. Second operand 4 states and 347 transitions. [2025-02-08 14:05:03,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 138 transitions, 463 flow [2025-02-08 14:05:03,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 138 transitions, 463 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:03,540 INFO L231 Difference]: Finished difference. Result has 122 places, 115 transitions, 277 flow [2025-02-08 14:05:03,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=122, PETRI_TRANSITIONS=115} [2025-02-08 14:05:03,543 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2025-02-08 14:05:03,543 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 115 transitions, 277 flow [2025-02-08 14:05:03,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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:05:03,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:03,544 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:03,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:05:03,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:05:03,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:03,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2085608903, now seen corresponding path program 1 times [2025-02-08 14:05:03,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:03,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087251080] [2025-02-08 14:05:03,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:03,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:03,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:03,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:03,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:03,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:03,775 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:05:03,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:03,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087251080] [2025-02-08 14:05:03,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087251080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:03,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:03,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:05:03,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126091571] [2025-02-08 14:05:03,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:03,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:05:03,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:03,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:05:03,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:05:03,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 133 [2025-02-08 14:05:03,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 115 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 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:05:03,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:03,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 133 [2025-02-08 14:05:03,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:10,918 INFO L124 PetriNetUnfolderBase]: 71309/117175 cut-off events. [2025-02-08 14:05:10,918 INFO L125 PetriNetUnfolderBase]: For 7069/7069 co-relation queries the response was YES. [2025-02-08 14:05:11,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224936 conditions, 117175 events. 71309/117175 cut-off events. For 7069/7069 co-relation queries the response was YES. Maximal size of possible extension queue 2681. Compared 1117318 event pairs, 8196 based on Foata normal form. 1872/112251 useless extension candidates. Maximal degree in co-relation 18776. Up to 66277 conditions per place. [2025-02-08 14:05:11,632 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 139 selfloop transitions, 6 changer transitions 0/203 dead transitions. [2025-02-08 14:05:11,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 203 transitions, 741 flow [2025-02-08 14:05:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:05:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:05:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2025-02-08 14:05:11,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-02-08 14:05:11,634 INFO L175 Difference]: Start difference. First operand has 122 places, 115 transitions, 277 flow. Second operand 6 states and 494 transitions. [2025-02-08 14:05:11,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 203 transitions, 741 flow [2025-02-08 14:05:11,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 203 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:11,637 INFO L231 Difference]: Finished difference. Result has 125 places, 114 transitions, 283 flow [2025-02-08 14:05:11,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=125, PETRI_TRANSITIONS=114} [2025-02-08 14:05:11,638 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2025-02-08 14:05:11,638 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 114 transitions, 283 flow [2025-02-08 14:05:11,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.5) internal successors, (357), 6 states have internal predecessors, (357), 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:05:11,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:11,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:11,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:05:11,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:05:11,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:11,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1545776038, now seen corresponding path program 1 times [2025-02-08 14:05:11,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:11,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234846477] [2025-02-08 14:05:11,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:11,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:11,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:11,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:11,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:11,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:11,690 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:05:11,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234846477] [2025-02-08 14:05:11,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234846477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:11,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:11,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:11,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195625927] [2025-02-08 14:05:11,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:11,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:11,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:11,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:11,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:11,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 133 [2025-02-08 14:05:11,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 114 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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:05:11,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:11,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 133 [2025-02-08 14:05:11,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand