./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.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_51-mutexptr_racefree.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 f222d5749b9bb10b4d4c09b2c40e45ee19dec77732a8593ce917652e8ca8a43e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:46:57,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:46:57,514 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:46:57,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:46:57,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:46:57,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:46:57,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:46:57,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:46:57,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:46:57,534 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:46:57,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:46:57,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:46:57,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:46:57,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:46:57,535 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:46:57,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:46:57,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:46:57,535 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:46:57,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:46:57,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:46:57,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:46:57,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:46:57,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:46:57,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:46:57,536 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:46:57,536 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:46:57,536 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:46:57,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:46:57,536 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:46:57,536 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:46:57,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:46:57,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:46:57,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:46:57,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:46:57,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:57,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:46:57,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:46:57,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:46:57,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:46:57,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:57,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:46:57,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:46:57,538 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:46:57,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:46:57,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:46:57,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:46:57,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:46:57,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:46:57,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:46:57,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:46:57,538 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 -> f222d5749b9bb10b4d4c09b2c40e45ee19dec77732a8593ce917652e8ca8a43e [2025-01-10 06:46:57,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:46:57,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:46:57,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:46:57,874 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:46:57,874 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:46:57,876 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_51-mutexptr_racefree.i [2025-01-10 06:46:59,238 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28f7baff9/bf466e958af64277a4486f37892d6f06/FLAGbab776216 [2025-01-10 06:46:59,607 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:46:59,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2025-01-10 06:46:59,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28f7baff9/bf466e958af64277a4486f37892d6f06/FLAGbab776216 [2025-01-10 06:46:59,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28f7baff9/bf466e958af64277a4486f37892d6f06 [2025-01-10 06:46:59,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:46:59,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:46:59,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:46:59,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:46:59,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:46:59,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:46:59" (1/1) ... [2025-01-10 06:46:59,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad74007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:59, skipping insertion in model container [2025-01-10 06:46:59,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:46:59" (1/1) ... [2025-01-10 06:46:59,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:46:59,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:46:59,956 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:46:59,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:47:00,026 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:47:00,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:00 WrapperNode [2025-01-10 06:47:00,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:47:00,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:47:00,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:47:00,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:47:00,032 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:47:00" (1/1) ... [2025-01-10 06:47:00,041 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:47:00" (1/1) ... [2025-01-10 06:47:00,058 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2025-01-10 06:47:00,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:47:00,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:47:00,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:47:00,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:47:00,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:00" (1/1) ... [2025-01-10 06:47:00,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:00" (1/1) ... [2025-01-10 06:47:00,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:00" (1/1) ... [2025-01-10 06:47:00,076 INFO L175 MemorySlicer]: Split 20 memory accesses to 5 slices as follows [2, 5, 5, 6, 2]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 5, 1, 0]. The 3 writes are split as follows [0, 0, 0, 2, 1]. [2025-01-10 06:47:00,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:00" (1/1) ... [2025-01-10 06:47:00,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:00" (1/1) ... [2025-01-10 06:47:00,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:00" (1/1) ... [2025-01-10 06:47:00,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:00" (1/1) ... [2025-01-10 06:47:00,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:00" (1/1) ... [2025-01-10 06:47:00,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:00" (1/1) ... [2025-01-10 06:47:00,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:00" (1/1) ... [2025-01-10 06:47:00,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:47:00,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:47:00,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:47:00,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:47:00,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:00" (1/1) ... [2025-01-10 06:47:00,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:47:00,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:47:00,144 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:47:00,153 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:47:00,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:47:00,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:47:00,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:47:00,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:47:00,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 06:47:00,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:47:00,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:47:00,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:47:00,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:47:00,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 06:47:00,169 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:47:00,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:47:00,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:47:00,170 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:47:00,170 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:47:00,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:47:00,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:47:00,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:47:00,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:47:00,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:47:00,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 06:47:00,172 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:47:00,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:47:00,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:47:00,174 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:47:00,275 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:47:00,277 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:47:00,472 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:47:00,472 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:47:00,781 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:47:00,781 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 06:47:00,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:47:00 BoogieIcfgContainer [2025-01-10 06:47:00,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:47:00,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:47:00,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:47:00,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:47:00,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:46:59" (1/3) ... [2025-01-10 06:47:00,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@870bbce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:47:00, skipping insertion in model container [2025-01-10 06:47:00,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:00" (2/3) ... [2025-01-10 06:47:00,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@870bbce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:47:00, skipping insertion in model container [2025-01-10 06:47:00,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:47:00" (3/3) ... [2025-01-10 06:47:00,788 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_51-mutexptr_racefree.i [2025-01-10 06:47:00,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:47:00,826 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_51-mutexptr_racefree.i that has 2 procedures, 51 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-01-10 06:47:00,827 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:47:00,856 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:47:00,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 60 transitions, 127 flow [2025-01-10 06:47:00,898 INFO L124 PetriNetUnfolderBase]: 11/75 cut-off events. [2025-01-10 06:47:00,899 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:47:00,904 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 9. Compared 224 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:47:00,905 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 60 transitions, 127 flow [2025-01-10 06:47:00,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 59 transitions, 125 flow [2025-01-10 06:47:00,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:47:00,924 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;@7d10f8c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:47:00,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 06:47:00,931 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:47:00,931 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:47:00,931 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:47:00,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:00,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:47:00,933 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:47:00,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:00,936 INFO L85 PathProgramCache]: Analyzing trace with hash 453746027, now seen corresponding path program 1 times [2025-01-10 06:47:00,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:00,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597440171] [2025-01-10 06:47:00,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:01,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:47:01,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:47:01,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:01,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:01,324 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:47:01,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:01,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597440171] [2025-01-10 06:47:01,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597440171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:01,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:01,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:01,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222858211] [2025-01-10 06:47:01,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:01,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:01,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:01,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:01,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:01,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-01-10 06:47:01,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 59 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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:47:01,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:01,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-01-10 06:47:01,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:01,625 INFO L124 PetriNetUnfolderBase]: 144/390 cut-off events. [2025-01-10 06:47:01,625 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:47:01,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 390 events. 144/390 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1832 event pairs, 20 based on Foata normal form. 78/439 useless extension candidates. Maximal degree in co-relation 683. Up to 277 conditions per place. [2025-01-10 06:47:01,632 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 49 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-01-10 06:47:01,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 259 flow [2025-01-10 06:47:01,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2025-01-10 06:47:01,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6791666666666667 [2025-01-10 06:47:01,647 INFO L175 Difference]: Start difference. First operand has 54 places, 59 transitions, 125 flow. Second operand 4 states and 163 transitions. [2025-01-10 06:47:01,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 259 flow [2025-01-10 06:47:01,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 259 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:47:01,656 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 115 flow [2025-01-10 06:47:01,658 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:47:01,662 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-01-10 06:47:01,662 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 115 flow [2025-01-10 06:47:01,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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:47:01,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:01,663 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:01,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:47:01,663 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:47:01,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:01,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1286273340, now seen corresponding path program 1 times [2025-01-10 06:47:01,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:01,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344833287] [2025-01-10 06:47:01,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:01,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:01,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:47:01,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:47:01,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:01,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:47:01,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:47:01,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:47:01,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:47:01,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:01,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:47:01,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:47:01,769 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:47:01,770 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-10 06:47:01,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-01-10 06:47:01,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-01-10 06:47:01,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-01-10 06:47:01,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-01-10 06:47:01,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-01-10 06:47:01,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-01-10 06:47:01,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-01-10 06:47:01,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-01-10 06:47:01,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-01-10 06:47:01,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-01-10 06:47:01,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-01-10 06:47:01,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-01-10 06:47:01,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:47:01,775 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 06:47:01,777 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:47:01,778 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:47:01,801 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:47:01,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 93 transitions, 202 flow [2025-01-10 06:47:01,822 INFO L124 PetriNetUnfolderBase]: 21/142 cut-off events. [2025-01-10 06:47:01,823 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:47:01,824 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 11. Compared 512 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:47:01,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 93 transitions, 202 flow [2025-01-10 06:47:01,825 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 93 transitions, 202 flow [2025-01-10 06:47:01,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:47:01,826 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;@7d10f8c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:47:01,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-10 06:47:01,829 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:47:01,829 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:47:01,829 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:47:01,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:01,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:47:01,829 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:47:01,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:01,830 INFO L85 PathProgramCache]: Analyzing trace with hash 542526183, now seen corresponding path program 1 times [2025-01-10 06:47:01,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:01,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235407358] [2025-01-10 06:47:01,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:01,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:01,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:47:01,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:47:01,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:01,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:01,915 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:47:01,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:01,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235407358] [2025-01-10 06:47:01,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235407358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:01,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:01,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:01,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339466725] [2025-01-10 06:47:01,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:01,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:01,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:01,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:01,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:01,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2025-01-10 06:47:01,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 93 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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:47:01,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:01,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2025-01-10 06:47:01,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:02,983 INFO L124 PetriNetUnfolderBase]: 4742/10057 cut-off events. [2025-01-10 06:47:02,983 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 06:47:02,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17647 conditions, 10057 events. 4742/10057 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 83538 event pairs, 2232 based on Foata normal form. 1787/10846 useless extension candidates. Maximal degree in co-relation 1308. Up to 7478 conditions per place. [2025-01-10 06:47:03,029 INFO L140 encePairwiseOnDemand]: 73/93 looper letters, 68 selfloop transitions, 3 changer transitions 0/106 dead transitions. [2025-01-10 06:47:03,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 106 transitions, 370 flow [2025-01-10 06:47:03,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2025-01-10 06:47:03,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2025-01-10 06:47:03,030 INFO L175 Difference]: Start difference. First operand has 82 places, 93 transitions, 202 flow. Second operand 4 states and 240 transitions. [2025-01-10 06:47:03,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 106 transitions, 370 flow [2025-01-10 06:47:03,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 106 transitions, 370 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:47:03,032 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 198 flow [2025-01-10 06:47:03,033 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:47:03,033 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places. [2025-01-10 06:47:03,033 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 198 flow [2025-01-10 06:47:03,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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:47:03,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:03,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:03,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:47:03,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:47:03,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash -420596041, now seen corresponding path program 1 times [2025-01-10 06:47:03,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:03,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539840843] [2025-01-10 06:47:03,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:03,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:03,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:47:03,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:47:03,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:03,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:03,115 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:47:03,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:03,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539840843] [2025-01-10 06:47:03,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539840843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:03,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:03,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:03,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071223305] [2025-01-10 06:47:03,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:03,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:03,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:03,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:03,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:03,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 93 [2025-01-10 06:47:03,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:03,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:03,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 93 [2025-01-10 06:47:03,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:04,150 INFO L124 PetriNetUnfolderBase]: 6126/12726 cut-off events. [2025-01-10 06:47:04,151 INFO L125 PetriNetUnfolderBase]: For 515/889 co-relation queries the response was YES. [2025-01-10 06:47:04,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23109 conditions, 12726 events. 6126/12726 cut-off events. For 515/889 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 109277 event pairs, 1719 based on Foata normal form. 232/11903 useless extension candidates. Maximal degree in co-relation 23002. Up to 6013 conditions per place. [2025-01-10 06:47:04,209 INFO L140 encePairwiseOnDemand]: 84/93 looper letters, 123 selfloop transitions, 12 changer transitions 0/172 dead transitions. [2025-01-10 06:47:04,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 172 transitions, 690 flow [2025-01-10 06:47:04,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:47:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:47:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 316 transitions. [2025-01-10 06:47:04,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6795698924731183 [2025-01-10 06:47:04,212 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 198 flow. Second operand 5 states and 316 transitions. [2025-01-10 06:47:04,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 172 transitions, 690 flow [2025-01-10 06:47:04,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 172 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:47:04,216 INFO L231 Difference]: Finished difference. Result has 94 places, 92 transitions, 290 flow [2025-01-10 06:47:04,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=94, PETRI_TRANSITIONS=92} [2025-01-10 06:47:04,218 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 12 predicate places. [2025-01-10 06:47:04,218 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 290 flow [2025-01-10 06:47:04,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:04,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:04,219 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:04,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:47:04,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:47:04,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:04,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1777407848, now seen corresponding path program 1 times [2025-01-10 06:47:04,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:04,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821908205] [2025-01-10 06:47:04,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:04,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:04,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:47:04,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:47:04,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:04,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:04,366 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:47:04,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:04,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821908205] [2025-01-10 06:47:04,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821908205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:04,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:04,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:47:04,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241172981] [2025-01-10 06:47:04,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:04,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:47:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:04,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:47:04,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:47:04,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2025-01-10 06:47:04,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 92 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 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:47:04,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:04,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2025-01-10 06:47:04,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:05,519 INFO L124 PetriNetUnfolderBase]: 6342/12978 cut-off events. [2025-01-10 06:47:05,520 INFO L125 PetriNetUnfolderBase]: For 4247/4254 co-relation queries the response was YES. [2025-01-10 06:47:05,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27114 conditions, 12978 events. 6342/12978 cut-off events. For 4247/4254 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 111146 event pairs, 1645 based on Foata normal form. 177/12192 useless extension candidates. Maximal degree in co-relation 17028. Up to 7737 conditions per place. [2025-01-10 06:47:05,586 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 133 selfloop transitions, 6 changer transitions 0/174 dead transitions. [2025-01-10 06:47:05,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 174 transitions, 814 flow [2025-01-10 06:47:05,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:47:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:47:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 329 transitions. [2025-01-10 06:47:05,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.589605734767025 [2025-01-10 06:47:05,588 INFO L175 Difference]: Start difference. First operand has 94 places, 92 transitions, 290 flow. Second operand 6 states and 329 transitions. [2025-01-10 06:47:05,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 174 transitions, 814 flow [2025-01-10 06:47:05,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 174 transitions, 814 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:47:05,598 INFO L231 Difference]: Finished difference. Result has 98 places, 91 transitions, 298 flow [2025-01-10 06:47:05,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2025-01-10 06:47:05,603 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 16 predicate places. [2025-01-10 06:47:05,603 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 298 flow [2025-01-10 06:47:05,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 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:47:05,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:05,604 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:47:05,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:47:05,604 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:47:05,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:05,604 INFO L85 PathProgramCache]: Analyzing trace with hash 734932119, now seen corresponding path program 1 times [2025-01-10 06:47:05,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:05,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662387619] [2025-01-10 06:47:05,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:05,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:05,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:47:05,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:47:05,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:05,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:05,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:05,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662387619] [2025-01-10 06:47:05,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662387619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:05,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:05,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:47:05,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901488089] [2025-01-10 06:47:05,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:05,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:05,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:05,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:05,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:05,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 93 [2025-01-10 06:47:05,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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:47:05,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:05,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 93 [2025-01-10 06:47:05,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:06,418 INFO L124 PetriNetUnfolderBase]: 6031/12033 cut-off events. [2025-01-10 06:47:06,418 INFO L125 PetriNetUnfolderBase]: For 5038/5043 co-relation queries the response was YES. [2025-01-10 06:47:06,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25955 conditions, 12033 events. 6031/12033 cut-off events. For 5038/5043 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 99174 event pairs, 2096 based on Foata normal form. 185/11523 useless extension candidates. Maximal degree in co-relation 18489. Up to 8290 conditions per place. [2025-01-10 06:47:06,469 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 108 selfloop transitions, 6 changer transitions 0/149 dead transitions. [2025-01-10 06:47:06,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 149 transitions, 704 flow [2025-01-10 06:47:06,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2025-01-10 06:47:06,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6236559139784946 [2025-01-10 06:47:06,471 INFO L175 Difference]: Start difference. First operand has 98 places, 91 transitions, 298 flow. Second operand 4 states and 232 transitions. [2025-01-10 06:47:06,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 149 transitions, 704 flow [2025-01-10 06:47:06,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 149 transitions, 688 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 06:47:06,480 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 298 flow [2025-01-10 06:47:06,480 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:47:06,481 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 14 predicate places. [2025-01-10 06:47:06,481 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 298 flow [2025-01-10 06:47:06,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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:47:06,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:06,481 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:47:06,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:47:06,482 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:47:06,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:06,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1895148491, now seen corresponding path program 1 times [2025-01-10 06:47:06,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:06,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509966605] [2025-01-10 06:47:06,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:06,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:06,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:47:06,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:47:06,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:06,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:47:06,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:47:06,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:47:06,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:47:06,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:06,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:47:06,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:47:06,531 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:47:06,531 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-01-10 06:47:06,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-01-10 06:47:06,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-01-10 06:47:06,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-01-10 06:47:06,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-01-10 06:47:06,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-01-10 06:47:06,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-01-10 06:47:06,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-01-10 06:47:06,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-01-10 06:47:06,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-01-10 06:47:06,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-01-10 06:47:06,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-01-10 06:47:06,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-01-10 06:47:06,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-01-10 06:47:06,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-01-10 06:47:06,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-01-10 06:47:06,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-01-10 06:47:06,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:47:06,535 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 06:47:06,535 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:47:06,535 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:47:06,575 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:47:06,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 126 transitions, 279 flow [2025-01-10 06:47:06,611 INFO L124 PetriNetUnfolderBase]: 34/228 cut-off events. [2025-01-10 06:47:06,611 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 06:47:06,612 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 12. Compared 933 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:47:06,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 126 transitions, 279 flow [2025-01-10 06:47:06,614 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 126 transitions, 279 flow [2025-01-10 06:47:06,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:47:06,618 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;@7d10f8c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:47:06,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-10 06:47:06,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:47:06,620 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-10 06:47:06,620 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:47:06,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:06,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:47:06,625 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:47:06,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:06,625 INFO L85 PathProgramCache]: Analyzing trace with hash 662798404, now seen corresponding path program 1 times [2025-01-10 06:47:06,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:06,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445725061] [2025-01-10 06:47:06,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:06,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:06,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:47:06,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:47:06,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:06,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:06,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:06,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445725061] [2025-01-10 06:47:06,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445725061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:06,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:06,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259167741] [2025-01-10 06:47:06,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:06,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:06,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:06,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:06,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:06,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 126 [2025-01-10 06:47:06,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 126 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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:47:06,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:06,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 126 [2025-01-10 06:47:06,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:16,362 INFO L124 PetriNetUnfolderBase]: 97039/174165 cut-off events. [2025-01-10 06:47:16,363 INFO L125 PetriNetUnfolderBase]: For 2042/2042 co-relation queries the response was YES. [2025-01-10 06:47:16,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309817 conditions, 174165 events. 97039/174165 cut-off events. For 2042/2042 co-relation queries the response was YES. Maximal size of possible extension queue 3678. Compared 1824515 event pairs, 63133 based on Foata normal form. 34646/193364 useless extension candidates. Maximal degree in co-relation 18235. Up to 134303 conditions per place. [2025-01-10 06:47:17,401 INFO L140 encePairwiseOnDemand]: 100/126 looper letters, 82 selfloop transitions, 3 changer transitions 0/133 dead transitions. [2025-01-10 06:47:17,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 133 transitions, 463 flow [2025-01-10 06:47:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 312 transitions. [2025-01-10 06:47:17,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-01-10 06:47:17,403 INFO L175 Difference]: Start difference. First operand has 110 places, 126 transitions, 279 flow. Second operand 4 states and 312 transitions. [2025-01-10 06:47:17,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 133 transitions, 463 flow [2025-01-10 06:47:17,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 133 transitions, 463 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:47:17,411 INFO L231 Difference]: Finished difference. Result has 115 places, 108 transitions, 263 flow [2025-01-10 06:47:17,412 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:47:17,416 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 5 predicate places. [2025-01-10 06:47:17,416 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 263 flow [2025-01-10 06:47:17,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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:47:17,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:17,416 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:17,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:47:17,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:47:17,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1752873656, now seen corresponding path program 1 times [2025-01-10 06:47:17,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:17,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070359797] [2025-01-10 06:47:17,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:17,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:17,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:47:17,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:47:17,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:17,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:17,510 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:47:17,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:17,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070359797] [2025-01-10 06:47:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070359797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:47:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947889942] [2025-01-10 06:47:17,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:17,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:47:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:17,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:47:17,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:47:17,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 126 [2025-01-10 06:47:17,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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:47:17,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:17,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 126 [2025-01-10 06:47:17,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:26,851 INFO L124 PetriNetUnfolderBase]: 90643/147308 cut-off events. [2025-01-10 06:47:26,851 INFO L125 PetriNetUnfolderBase]: For 10661/10661 co-relation queries the response was YES. [2025-01-10 06:47:27,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283731 conditions, 147308 events. 90643/147308 cut-off events. For 10661/10661 co-relation queries the response was YES. Maximal size of possible extension queue 3055. Compared 1384142 event pairs, 10114 based on Foata normal form. 2366/141100 useless extension candidates. Maximal degree in co-relation 21875. Up to 83865 conditions per place. [2025-01-10 06:47:27,721 INFO L140 encePairwiseOnDemand]: 121/126 looper letters, 150 selfloop transitions, 6 changer transitions 0/204 dead transitions. [2025-01-10 06:47:27,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 204 transitions, 765 flow [2025-01-10 06:47:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:47:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:47:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 445 transitions. [2025-01-10 06:47:27,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5886243386243386 [2025-01-10 06:47:27,723 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 263 flow. Second operand 6 states and 445 transitions. [2025-01-10 06:47:27,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 204 transitions, 765 flow [2025-01-10 06:47:27,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 204 transitions, 763 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:47:27,727 INFO L231 Difference]: Finished difference. Result has 118 places, 107 transitions, 269 flow [2025-01-10 06:47:27,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=118, PETRI_TRANSITIONS=107} [2025-01-10 06:47:27,729 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 8 predicate places. [2025-01-10 06:47:27,729 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 107 transitions, 269 flow [2025-01-10 06:47:27,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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:47:27,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:27,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:27,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:47:27,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:47:27,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:27,730 INFO L85 PathProgramCache]: Analyzing trace with hash -160483978, now seen corresponding path program 1 times [2025-01-10 06:47:27,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:27,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072638130] [2025-01-10 06:47:27,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:27,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:27,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:47:27,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:47:27,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:27,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:27,795 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:47:27,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:27,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072638130] [2025-01-10 06:47:27,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072638130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:27,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:27,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:47:27,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464027562] [2025-01-10 06:47:27,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:27,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:47:27,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:27,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:47:27,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:47:27,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 126 [2025-01-10 06:47:27,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 107 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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:47:27,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:27,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 126 [2025-01-10 06:47:27,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand