./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-551b009-m [2025-01-10 06:45:13,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:45:13,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:45:13,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:45:13,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:45:13,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:45:13,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:45:13,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:45:13,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:45:13,428 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:45:13,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:45:13,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:45:13,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:45:13,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:45:13,429 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:45:13,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:45:13,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:45:13,429 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:45:13,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:45:13,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:45:13,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:45:13,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:45:13,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:45:13,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:45:13,430 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:45:13,430 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:45:13,430 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:45:13,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:45:13,430 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:45:13,430 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:45:13,430 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:45:13,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:45:13,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:45:13,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:45:13,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:13,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:45:13,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:45:13,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:45:13,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:45:13,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:13,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:45:13,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:45:13,432 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:45:13,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:45:13,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:45:13,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:45:13,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:45:13,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:45:13,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:45:13,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:45:13,432 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-01-10 06:45:13,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:45:13,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:45:13,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:45:13,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:45:13,662 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:45:13,663 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-01-10 06:45:14,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/664e5e427/3a306998674c4f82a9193daea5409550/FLAG6e62baa3f [2025-01-10 06:45:15,136 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:45:15,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-01-10 06:45:15,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/664e5e427/3a306998674c4f82a9193daea5409550/FLAG6e62baa3f [2025-01-10 06:45:15,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/664e5e427/3a306998674c4f82a9193daea5409550 [2025-01-10 06:45:15,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:45:15,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:45:15,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:45:15,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:45:15,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:45:15,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40fe0f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15, skipping insertion in model container [2025-01-10 06:45:15,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:45:15,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:45:15,744 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:45:15,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:45:15,813 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:45:15,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15 WrapperNode [2025-01-10 06:45:15,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:45:15,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:45:15,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:45:15,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:45:15,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,839 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2025-01-10 06:45:15,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:45:15,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:45:15,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:45:15,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:45:15,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,857 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 2, 5]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 0, 5]. The 1 writes are split as follows [0, 0, 0, 1, 0]. [2025-01-10 06:45:15,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,862 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,862 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:45:15,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:45:15,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:45:15,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:45:15,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15" (1/1) ... [2025-01-10 06:45:15,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:15,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:45:15,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:45:15,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:45:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:45:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:45:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:45:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:45:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 06:45:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:45:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:45:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:45:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:45:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 06:45:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:45:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:45:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:45:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:45:15,922 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:45:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:45:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:45:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:45:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:45:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:45:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 06:45:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:45:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:45:15,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:45:15,923 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:45:16,034 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:45:16,036 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:45:16,186 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:45:16,187 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:45:16,300 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:45:16,300 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 06:45:16,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:45:16 BoogieIcfgContainer [2025-01-10 06:45:16,301 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:45:16,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:45:16,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:45:16,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:45:16,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:45:15" (1/3) ... [2025-01-10 06:45:16,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f2dc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:45:16, skipping insertion in model container [2025-01-10 06:45:16,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:15" (2/3) ... [2025-01-10 06:45:16,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f2dc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:45:16, skipping insertion in model container [2025-01-10 06:45:16,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:45:16" (3/3) ... [2025-01-10 06:45:16,311 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2025-01-10 06:45:16,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:45:16,323 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_01-simple_racing.i that has 2 procedures, 51 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-01-10 06:45:16,323 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:45:16,362 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:45:16,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 60 transitions, 127 flow [2025-01-10 06:45:16,426 INFO L124 PetriNetUnfolderBase]: 11/75 cut-off events. [2025-01-10 06:45:16,427 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:45:16,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 75 events. 11/75 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 222 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 51. Up to 4 conditions per place. [2025-01-10 06:45:16,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 60 transitions, 127 flow [2025-01-10 06:45:16,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 59 transitions, 125 flow [2025-01-10 06:45:16,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:45:16,451 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;@49a01159, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:45:16,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 06:45:16,462 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:45:16,463 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:45:16,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:16,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:16,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:45:16,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:45:16,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:16,470 INFO L85 PathProgramCache]: Analyzing trace with hash 336121122, now seen corresponding path program 1 times [2025-01-10 06:45:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:16,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316669942] [2025-01-10 06:45:16,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:16,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:16,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:45:16,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:45:16,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:16,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:16,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:16,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316669942] [2025-01-10 06:45:16,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316669942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:16,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:16,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:16,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596604451] [2025-01-10 06:45:16,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:16,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:16,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:16,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:16,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:16,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2025-01-10 06:45:16,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 59 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:16,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:16,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2025-01-10 06:45:16,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:17,003 INFO L124 PetriNetUnfolderBase]: 132/361 cut-off events. [2025-01-10 06:45:17,004 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:45:17,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 361 events. 132/361 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1742 event pairs, 20 based on Foata normal form. 76/410 useless extension candidates. Maximal degree in co-relation 630. Up to 255 conditions per place. [2025-01-10 06:45:17,009 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 46 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2025-01-10 06:45:17,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 249 flow [2025-01-10 06:45:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-01-10 06:45:17,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-01-10 06:45:17,025 INFO L175 Difference]: Start difference. First operand has 54 places, 59 transitions, 125 flow. Second operand 4 states and 164 transitions. [2025-01-10 06:45:17,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 249 flow [2025-01-10 06:45:17,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 249 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:17,036 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 115 flow [2025-01-10 06:45:17,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2025-01-10 06:45:17,045 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-01-10 06:45:17,045 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 115 flow [2025-01-10 06:45:17,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:17,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:17,045 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:17,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:45:17,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:45:17,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:17,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1815946535, now seen corresponding path program 1 times [2025-01-10 06:45:17,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:17,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677423984] [2025-01-10 06:45:17,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:17,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:17,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:45:17,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:45:17,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:17,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:17,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:45:17,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:45:17,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:45:17,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:17,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:17,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:45:17,124 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:45:17,125 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-10 06:45:17,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-01-10 06:45:17,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-01-10 06:45:17,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-01-10 06:45:17,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-01-10 06:45:17,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-01-10 06:45:17,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-01-10 06:45:17,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-01-10 06:45:17,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-01-10 06:45:17,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-01-10 06:45:17,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-01-10 06:45:17,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-01-10 06:45:17,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-01-10 06:45:17,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:45:17,128 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 06:45:17,130 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:45:17,130 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:45:17,143 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:45:17,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 93 transitions, 202 flow [2025-01-10 06:45:17,157 INFO L124 PetriNetUnfolderBase]: 21/142 cut-off events. [2025-01-10 06:45:17,158 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:45:17,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 142 events. 21/142 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 506 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 91. Up to 6 conditions per place. [2025-01-10 06:45:17,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 93 transitions, 202 flow [2025-01-10 06:45:17,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 93 transitions, 202 flow [2025-01-10 06:45:17,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:45:17,161 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;@49a01159, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:45:17,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-10 06:45:17,162 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:45:17,162 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:45:17,162 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:17,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:17,163 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:45:17,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:17,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:17,163 INFO L85 PathProgramCache]: Analyzing trace with hash 424901278, now seen corresponding path program 1 times [2025-01-10 06:45:17,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:17,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839711733] [2025-01-10 06:45:17,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:17,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:17,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:45:17,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:45:17,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:17,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:17,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:17,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839711733] [2025-01-10 06:45:17,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839711733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:17,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:17,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:17,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98818860] [2025-01-10 06:45:17,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:17,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:17,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:17,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:17,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:17,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 93 [2025-01-10 06:45:17,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 93 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:17,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:17,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 93 [2025-01-10 06:45:17,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:18,193 INFO L124 PetriNetUnfolderBase]: 4028/8614 cut-off events. [2025-01-10 06:45:18,194 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-01-10 06:45:18,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15092 conditions, 8614 events. 4028/8614 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 72010 event pairs, 1892 based on Foata normal form. 1643/9371 useless extension candidates. Maximal degree in co-relation 1207. Up to 6374 conditions per place. [2025-01-10 06:45:18,230 INFO L140 encePairwiseOnDemand]: 73/93 looper letters, 64 selfloop transitions, 3 changer transitions 0/104 dead transitions. [2025-01-10 06:45:18,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 104 transitions, 358 flow [2025-01-10 06:45:18,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2025-01-10 06:45:18,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6559139784946236 [2025-01-10 06:45:18,236 INFO L175 Difference]: Start difference. First operand has 82 places, 93 transitions, 202 flow. Second operand 4 states and 244 transitions. [2025-01-10 06:45:18,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 104 transitions, 358 flow [2025-01-10 06:45:18,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 104 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:18,238 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 198 flow [2025-01-10 06:45:18,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2025-01-10 06:45:18,238 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places. [2025-01-10 06:45:18,238 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 198 flow [2025-01-10 06:45:18,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:18,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:18,239 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:18,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:45:18,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:18,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:18,239 INFO L85 PathProgramCache]: Analyzing trace with hash 432387348, now seen corresponding path program 1 times [2025-01-10 06:45:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:18,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095643807] [2025-01-10 06:45:18,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:18,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:18,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:18,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:45:18,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:18,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:18,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:18,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095643807] [2025-01-10 06:45:18,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095643807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:18,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:18,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:45:18,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725752783] [2025-01-10 06:45:18,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:18,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:45:18,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:18,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:45:18,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:45:18,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 93 [2025-01-10 06:45:18,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:18,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:18,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 93 [2025-01-10 06:45:18,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:19,186 INFO L124 PetriNetUnfolderBase]: 3764/7354 cut-off events. [2025-01-10 06:45:19,187 INFO L125 PetriNetUnfolderBase]: For 624/624 co-relation queries the response was YES. [2025-01-10 06:45:19,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14064 conditions, 7354 events. 3764/7354 cut-off events. For 624/624 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 57904 event pairs, 252 based on Foata normal form. 144/7011 useless extension candidates. Maximal degree in co-relation 1168. Up to 4012 conditions per place. [2025-01-10 06:45:19,216 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 104 selfloop transitions, 6 changer transitions 0/147 dead transitions. [2025-01-10 06:45:19,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 147 transitions, 548 flow [2025-01-10 06:45:19,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:45:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:45:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 333 transitions. [2025-01-10 06:45:19,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5967741935483871 [2025-01-10 06:45:19,218 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 198 flow. Second operand 6 states and 333 transitions. [2025-01-10 06:45:19,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 147 transitions, 548 flow [2025-01-10 06:45:19,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 147 transitions, 546 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:45:19,221 INFO L231 Difference]: Finished difference. Result has 90 places, 80 transitions, 204 flow [2025-01-10 06:45:19,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=90, PETRI_TRANSITIONS=80} [2025-01-10 06:45:19,222 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 8 predicate places. [2025-01-10 06:45:19,222 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 80 transitions, 204 flow [2025-01-10 06:45:19,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:19,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:19,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:19,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:45:19,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:19,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:19,223 INFO L85 PathProgramCache]: Analyzing trace with hash 639774287, now seen corresponding path program 1 times [2025-01-10 06:45:19,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:19,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573271129] [2025-01-10 06:45:19,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:19,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:19,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:19,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:45:19,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:19,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:19,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:19,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573271129] [2025-01-10 06:45:19,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573271129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:19,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:19,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:19,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173161677] [2025-01-10 06:45:19,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:19,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:19,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:19,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:19,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:19,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 93 [2025-01-10 06:45:19,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 80 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:19,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:19,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 93 [2025-01-10 06:45:19,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:20,107 INFO L124 PetriNetUnfolderBase]: 5385/11251 cut-off events. [2025-01-10 06:45:20,107 INFO L125 PetriNetUnfolderBase]: For 1334/1495 co-relation queries the response was YES. [2025-01-10 06:45:20,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20759 conditions, 11251 events. 5385/11251 cut-off events. For 1334/1495 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 96958 event pairs, 1446 based on Foata normal form. 209/10504 useless extension candidates. Maximal degree in co-relation 16761. Up to 5441 conditions per place. [2025-01-10 06:45:20,172 INFO L140 encePairwiseOnDemand]: 84/93 looper letters, 118 selfloop transitions, 12 changer transitions 0/168 dead transitions. [2025-01-10 06:45:20,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 168 transitions, 694 flow [2025-01-10 06:45:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:45:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:45:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2025-01-10 06:45:20,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6903225806451613 [2025-01-10 06:45:20,174 INFO L175 Difference]: Start difference. First operand has 90 places, 80 transitions, 204 flow. Second operand 5 states and 321 transitions. [2025-01-10 06:45:20,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 168 transitions, 694 flow [2025-01-10 06:45:20,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 168 transitions, 671 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 06:45:20,180 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 286 flow [2025-01-10 06:45:20,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2025-01-10 06:45:20,181 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 12 predicate places. [2025-01-10 06:45:20,181 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 286 flow [2025-01-10 06:45:20,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:20,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:20,181 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:45:20,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:45:20,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:20,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash 519106365, now seen corresponding path program 1 times [2025-01-10 06:45:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:20,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330432191] [2025-01-10 06:45:20,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:20,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:45:20,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:45:20,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:20,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:20,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:20,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330432191] [2025-01-10 06:45:20,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330432191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:20,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:20,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:45:20,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902823099] [2025-01-10 06:45:20,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:20,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:20,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:20,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:20,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:20,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 93 [2025-01-10 06:45:20,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:20,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:20,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 93 [2025-01-10 06:45:20,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:21,149 INFO L124 PetriNetUnfolderBase]: 5241/10543 cut-off events. [2025-01-10 06:45:21,149 INFO L125 PetriNetUnfolderBase]: For 4175/4180 co-relation queries the response was YES. [2025-01-10 06:45:21,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22348 conditions, 10543 events. 5241/10543 cut-off events. For 4175/4180 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 87597 event pairs, 1919 based on Foata normal form. 160/10081 useless extension candidates. Maximal degree in co-relation 16961. Up to 7253 conditions per place. [2025-01-10 06:45:21,220 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 102 selfloop transitions, 6 changer transitions 0/145 dead transitions. [2025-01-10 06:45:21,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 145 transitions, 672 flow [2025-01-10 06:45:21,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 234 transitions. [2025-01-10 06:45:21,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6290322580645161 [2025-01-10 06:45:21,222 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 286 flow. Second operand 4 states and 234 transitions. [2025-01-10 06:45:21,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 145 transitions, 672 flow [2025-01-10 06:45:21,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 145 transitions, 668 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:45:21,238 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 298 flow [2025-01-10 06:45:21,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2025-01-10 06:45:21,239 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 14 predicate places. [2025-01-10 06:45:21,239 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 298 flow [2025-01-10 06:45:21,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:21,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:21,243 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:45:21,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:45:21,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:21,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:21,243 INFO L85 PathProgramCache]: Analyzing trace with hash 645023953, now seen corresponding path program 1 times [2025-01-10 06:45:21,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:21,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332367747] [2025-01-10 06:45:21,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:21,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:21,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:45:21,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:45:21,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:21,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:21,265 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:45:21,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:45:21,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:45:21,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:21,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:21,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:45:21,330 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:45:21,330 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-01-10 06:45:21,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-01-10 06:45:21,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-01-10 06:45:21,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-01-10 06:45:21,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-01-10 06:45:21,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-01-10 06:45:21,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-01-10 06:45:21,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-01-10 06:45:21,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-01-10 06:45:21,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-01-10 06:45:21,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-01-10 06:45:21,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-01-10 06:45:21,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-01-10 06:45:21,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-01-10 06:45:21,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-01-10 06:45:21,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-01-10 06:45:21,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-01-10 06:45:21,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:45:21,332 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 06:45:21,332 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:45:21,332 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:45:21,353 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:45:21,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 126 transitions, 279 flow [2025-01-10 06:45:21,369 INFO L124 PetriNetUnfolderBase]: 34/228 cut-off events. [2025-01-10 06:45:21,369 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 06:45:21,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 228 events. 34/228 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 924 event pairs, 1 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 157. Up to 12 conditions per place. [2025-01-10 06:45:21,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 126 transitions, 279 flow [2025-01-10 06:45:21,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 126 transitions, 279 flow [2025-01-10 06:45:21,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:45:21,377 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;@49a01159, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:45:21,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-10 06:45:21,378 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:45:21,378 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-10 06:45:21,378 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:21,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:21,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:45:21,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:45:21,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:21,382 INFO L85 PathProgramCache]: Analyzing trace with hash 545173499, now seen corresponding path program 1 times [2025-01-10 06:45:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:21,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899285522] [2025-01-10 06:45:21,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:21,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:45:21,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:45:21,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:21,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:21,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:21,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899285522] [2025-01-10 06:45:21,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899285522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:21,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:21,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:21,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536075206] [2025-01-10 06:45:21,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:21,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:21,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:21,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:21,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:21,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 126 [2025-01-10 06:45:21,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 126 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:21,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:21,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 126 [2025-01-10 06:45:21,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:29,970 INFO L124 PetriNetUnfolderBase]: 76325/138173 cut-off events. [2025-01-10 06:45:29,971 INFO L125 PetriNetUnfolderBase]: For 1879/1879 co-relation queries the response was YES. [2025-01-10 06:45:30,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245270 conditions, 138173 events. 76325/138173 cut-off events. For 1879/1879 co-relation queries the response was YES. Maximal size of possible extension queue 3150. Compared 1451191 event pairs, 49600 based on Foata normal form. 29480/155051 useless extension candidates. Maximal degree in co-relation 15960. Up to 105935 conditions per place. [2025-01-10 06:45:31,243 INFO L140 encePairwiseOnDemand]: 100/126 looper letters, 77 selfloop transitions, 3 changer transitions 0/131 dead transitions. [2025-01-10 06:45:31,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 131 transitions, 449 flow [2025-01-10 06:45:31,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2025-01-10 06:45:31,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6329365079365079 [2025-01-10 06:45:31,246 INFO L175 Difference]: Start difference. First operand has 110 places, 126 transitions, 279 flow. Second operand 4 states and 319 transitions. [2025-01-10 06:45:31,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 131 transitions, 449 flow [2025-01-10 06:45:31,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 131 transitions, 449 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:31,251 INFO L231 Difference]: Finished difference. Result has 115 places, 108 transitions, 263 flow [2025-01-10 06:45:31,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2025-01-10 06:45:31,252 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 5 predicate places. [2025-01-10 06:45:31,252 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 263 flow [2025-01-10 06:45:31,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:31,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:31,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:31,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:45:31,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:45:31,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:31,253 INFO L85 PathProgramCache]: Analyzing trace with hash 899886350, now seen corresponding path program 1 times [2025-01-10 06:45:31,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:31,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254091510] [2025-01-10 06:45:31,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:31,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:31,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:31,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:45:31,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:31,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:31,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:31,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254091510] [2025-01-10 06:45:31,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254091510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:31,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:31,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:31,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711457994] [2025-01-10 06:45:31,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:31,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:31,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:31,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:31,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:31,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 126 [2025-01-10 06:45:31,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:31,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:31,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 126 [2025-01-10 06:45:31,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:43,670 INFO L124 PetriNetUnfolderBase]: 111387/192543 cut-off events. [2025-01-10 06:45:43,671 INFO L125 PetriNetUnfolderBase]: For 7138/11658 co-relation queries the response was YES. [2025-01-10 06:45:44,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354539 conditions, 192543 events. 111387/192543 cut-off events. For 7138/11658 co-relation queries the response was YES. Maximal size of possible extension queue 4534. Compared 2000777 event pairs, 38008 based on Foata normal form. 2848/180517 useless extension candidates. Maximal degree in co-relation 354437. Up to 101431 conditions per place. [2025-01-10 06:45:45,191 INFO L140 encePairwiseOnDemand]: 115/126 looper letters, 170 selfloop transitions, 16 changer transitions 0/239 dead transitions. [2025-01-10 06:45:45,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 239 transitions, 967 flow [2025-01-10 06:45:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:45:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:45:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 447 transitions. [2025-01-10 06:45:45,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7095238095238096 [2025-01-10 06:45:45,194 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 263 flow. Second operand 5 states and 447 transitions. [2025-01-10 06:45:45,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 239 transitions, 967 flow [2025-01-10 06:45:45,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 239 transitions, 963 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:45:45,203 INFO L231 Difference]: Finished difference. Result has 122 places, 123 transitions, 389 flow [2025-01-10 06:45:45,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=389, PETRI_PLACES=122, PETRI_TRANSITIONS=123} [2025-01-10 06:45:45,204 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 12 predicate places. [2025-01-10 06:45:45,204 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 389 flow [2025-01-10 06:45:45,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:45,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:45,204 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:45,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:45:45,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:45:45,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:45,205 INFO L85 PathProgramCache]: Analyzing trace with hash -332298444, now seen corresponding path program 1 times [2025-01-10 06:45:45,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:45,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456838154] [2025-01-10 06:45:45,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:45,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:45,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:45,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:45:45,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:45,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:45,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:45,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456838154] [2025-01-10 06:45:45,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456838154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:45,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:45,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:45:45,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039228534] [2025-01-10 06:45:45,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:45,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:45:45,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:45,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:45:45,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:45:45,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 126 [2025-01-10 06:45:45,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 389 flow. Second operand has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:45:45,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:45,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 126 [2025-01-10 06:45:45,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand