./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true.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/36-apron_22-traces-write-centered-vs-meet-mutex_true.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 7b8a2d8a35be535b4f8c573d98b12278b19043c6b0cec82927e2ac6d7dd36ebb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:48:23,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:48:23,376 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:48:23,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:48:23,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:48:23,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:48:23,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:48:23,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:48:23,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:48:23,403 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:48:23,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:48:23,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:48:23,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:48:23,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:48:23,404 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:48:23,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:48:23,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:48:23,404 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:48:23,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:48:23,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:48:23,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:48:23,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:48:23,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:48:23,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:48:23,404 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:48:23,404 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:48:23,405 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:48:23,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:48:23,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:48:23,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:48:23,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:48:23,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:48:23,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:48:23,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:48:23,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:48:23,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:48:23,406 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 -> 7b8a2d8a35be535b4f8c573d98b12278b19043c6b0cec82927e2ac6d7dd36ebb [2025-01-10 06:48:23,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:48:23,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:48:23,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:48:23,637 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:48:23,637 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:48:23,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true.i [2025-01-10 06:48:24,923 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16fc5b057/a56da470a2834aaa8ab452419ff28f83/FLAG56a26242f [2025-01-10 06:48:25,223 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:48:25,224 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true.i [2025-01-10 06:48:25,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16fc5b057/a56da470a2834aaa8ab452419ff28f83/FLAG56a26242f [2025-01-10 06:48:25,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16fc5b057/a56da470a2834aaa8ab452419ff28f83 [2025-01-10 06:48:25,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:48:25,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:48:25,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:48:25,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:48:25,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:48:25,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aeeed1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25, skipping insertion in model container [2025-01-10 06:48:25,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:48:25,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:48:25,582 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:48:25,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:48:25,636 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:48:25,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25 WrapperNode [2025-01-10 06:48:25,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:48:25,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:48:25,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:48:25,638 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:48:25,642 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:48:25" (1/1) ... [2025-01-10 06:48:25,653 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:48:25" (1/1) ... [2025-01-10 06:48:25,675 INFO L138 Inliner]: procedures = 163, calls = 43, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 142 [2025-01-10 06:48:25,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:48:25,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:48:25,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:48:25,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:48:25,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,711 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-10 06:48:25,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,718 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:48:25,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:48:25,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:48:25,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:48:25,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:48:25,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:48:25,767 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:48:25,775 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:48:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:48:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:48:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:48:25,789 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:48:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:48:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:48:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:48:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:48:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:48:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:48:25,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:48:25,790 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:48:25,897 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:48:25,899 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:48:26,141 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:48:26,141 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:48:26,270 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:48:26,271 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:48:26,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:48:26 BoogieIcfgContainer [2025-01-10 06:48:26,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:48:26,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:48:26,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:48:26,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:48:26,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:48:25" (1/3) ... [2025-01-10 06:48:26,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4145410c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:48:26, skipping insertion in model container [2025-01-10 06:48:26,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (2/3) ... [2025-01-10 06:48:26,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4145410c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:48:26, skipping insertion in model container [2025-01-10 06:48:26,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:48:26" (3/3) ... [2025-01-10 06:48:26,281 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true.i [2025-01-10 06:48:26,293 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:48:26,294 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true.i that has 2 procedures, 46 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-10 06:48:26,294 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:48:26,354 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:48:26,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 47 transitions, 98 flow [2025-01-10 06:48:26,412 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2025-01-10 06:48:26,416 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:48:26,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 47 events. 1/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-01-10 06:48:26,421 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 47 transitions, 98 flow [2025-01-10 06:48:26,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 45 transitions, 93 flow [2025-01-10 06:48:26,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:48:26,442 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;@e561640, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:48:26,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 06:48:26,450 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:48:26,450 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-10 06:48:26,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:48:26,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:26,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:26,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:48:26,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:26,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1868909197, now seen corresponding path program 1 times [2025-01-10 06:48:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:26,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520113435] [2025-01-10 06:48:26,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:26,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:26,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:48:26,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:48:26,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:26,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:26,664 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:48:26,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:26,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520113435] [2025-01-10 06:48:26,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520113435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:26,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:26,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:48:26,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268808469] [2025-01-10 06:48:26,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:26,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:48:26,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:26,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:48:26,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:48:26,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-01-10 06:48:26,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:48:26,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:26,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-01-10 06:48:26,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:26,815 INFO L124 PetriNetUnfolderBase]: 193/501 cut-off events. [2025-01-10 06:48:26,815 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:48:26,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 501 events. 193/501 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2407 event pairs, 165 based on Foata normal form. 12/483 useless extension candidates. Maximal degree in co-relation 893. Up to 373 conditions per place. [2025-01-10 06:48:26,818 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 35 selfloop transitions, 2 changer transitions 4/55 dead transitions. [2025-01-10 06:48:26,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 195 flow [2025-01-10 06:48:26,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:48:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:48:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-01-10 06:48:26,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2025-01-10 06:48:26,831 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 93 flow. Second operand 3 states and 87 transitions. [2025-01-10 06:48:26,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 195 flow [2025-01-10 06:48:26,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:48:26,835 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 94 flow [2025-01-10 06:48:26,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-01-10 06:48:26,838 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2025-01-10 06:48:26,838 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 94 flow [2025-01-10 06:48:26,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:48:26,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:26,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:26,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:48:26,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:48:26,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2101610671, now seen corresponding path program 1 times [2025-01-10 06:48:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:26,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889697603] [2025-01-10 06:48:26,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:26,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:26,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:48:26,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:48:26,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:26,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:26,918 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:48:26,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:26,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889697603] [2025-01-10 06:48:26,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889697603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:26,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:26,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:48:26,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023752551] [2025-01-10 06:48:26,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:26,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:48:26,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:26,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:48:26,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:48:26,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-01-10 06:48:26,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:48:26,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:26,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-01-10 06:48:26,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:27,084 INFO L124 PetriNetUnfolderBase]: 181/471 cut-off events. [2025-01-10 06:48:27,084 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:48:27,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 471 events. 181/471 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2190 event pairs, 154 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 851. Up to 350 conditions per place. [2025-01-10 06:48:27,087 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 30 selfloop transitions, 2 changer transitions 11/54 dead transitions. [2025-01-10 06:48:27,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 194 flow [2025-01-10 06:48:27,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:48:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:48:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-01-10 06:48:27,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6099290780141844 [2025-01-10 06:48:27,088 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 94 flow. Second operand 3 states and 86 transitions. [2025-01-10 06:48:27,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 194 flow [2025-01-10 06:48:27,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:48:27,090 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 78 flow [2025-01-10 06:48:27,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2025-01-10 06:48:27,091 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2025-01-10 06:48:27,091 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 78 flow [2025-01-10 06:48:27,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:48:27,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:27,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:27,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:48:27,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:48:27,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:27,092 INFO L85 PathProgramCache]: Analyzing trace with hash -826753573, now seen corresponding path program 1 times [2025-01-10 06:48:27,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:27,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695069015] [2025-01-10 06:48:27,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:27,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:27,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:48:27,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:48:27,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:27,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:27,181 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:48:27,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:27,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695069015] [2025-01-10 06:48:27,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695069015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:27,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:27,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:48:27,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731314033] [2025-01-10 06:48:27,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:27,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:48:27,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:27,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:48:27,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:48:27,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-01-10 06:48:27,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:48:27,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:27,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-01-10 06:48:27,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:27,310 INFO L124 PetriNetUnfolderBase]: 159/427 cut-off events. [2025-01-10 06:48:27,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:48:27,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 427 events. 159/427 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1930 event pairs, 75 based on Foata normal form. 32/454 useless extension candidates. Maximal degree in co-relation 796. Up to 223 conditions per place. [2025-01-10 06:48:27,313 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 28 selfloop transitions, 2 changer transitions 22/61 dead transitions. [2025-01-10 06:48:27,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 234 flow [2025-01-10 06:48:27,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:48:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:48:27,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-01-10 06:48:27,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5574468085106383 [2025-01-10 06:48:27,315 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 78 flow. Second operand 5 states and 131 transitions. [2025-01-10 06:48:27,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 234 flow [2025-01-10 06:48:27,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:48:27,316 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 90 flow [2025-01-10 06:48:27,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-01-10 06:48:27,320 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2025-01-10 06:48:27,321 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 90 flow [2025-01-10 06:48:27,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:48:27,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:27,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:27,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:48:27,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:48:27,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2095470248, now seen corresponding path program 1 times [2025-01-10 06:48:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:27,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340638096] [2025-01-10 06:48:27,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:27,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:48:27,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:48:27,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:27,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:27,487 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:48:27,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:27,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340638096] [2025-01-10 06:48:27,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340638096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:27,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:27,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:48:27,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941039316] [2025-01-10 06:48:27,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:27,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:48:27,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:27,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:48:27,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:48:27,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-01-10 06:48:27,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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:48:27,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:27,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-01-10 06:48:27,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:27,685 INFO L124 PetriNetUnfolderBase]: 149/394 cut-off events. [2025-01-10 06:48:27,685 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-01-10 06:48:27,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 394 events. 149/394 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1809 event pairs, 62 based on Foata normal form. 12/401 useless extension candidates. Maximal degree in co-relation 817. Up to 183 conditions per place. [2025-01-10 06:48:27,687 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 55 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2025-01-10 06:48:27,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 286 flow [2025-01-10 06:48:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:48:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:48:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2025-01-10 06:48:27,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2025-01-10 06:48:27,689 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 90 flow. Second operand 6 states and 152 transitions. [2025-01-10 06:48:27,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 286 flow [2025-01-10 06:48:27,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 266 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-01-10 06:48:27,690 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 113 flow [2025-01-10 06:48:27,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-01-10 06:48:27,691 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2025-01-10 06:48:27,691 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 113 flow [2025-01-10 06:48:27,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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:48:27,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:27,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:27,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:48:27,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:48:27,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash 535068688, now seen corresponding path program 1 times [2025-01-10 06:48:27,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:27,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723639110] [2025-01-10 06:48:27,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:27,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:27,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 06:48:27,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 06:48:27,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:27,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:27,802 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:48:27,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:27,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723639110] [2025-01-10 06:48:27,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723639110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:27,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:27,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:48:27,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706416062] [2025-01-10 06:48:27,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:27,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:48:27,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:27,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:48:27,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:48:27,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2025-01-10 06:48:27,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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:48:27,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:27,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2025-01-10 06:48:27,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:27,995 INFO L124 PetriNetUnfolderBase]: 138/384 cut-off events. [2025-01-10 06:48:27,995 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-01-10 06:48:27,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 384 events. 138/384 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1779 event pairs, 62 based on Foata normal form. 12/391 useless extension candidates. Maximal degree in co-relation 785. Up to 183 conditions per place. [2025-01-10 06:48:27,997 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 37 selfloop transitions, 3 changer transitions 29/78 dead transitions. [2025-01-10 06:48:27,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 331 flow [2025-01-10 06:48:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:48:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:48:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2025-01-10 06:48:28,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5079787234042553 [2025-01-10 06:48:28,001 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 113 flow. Second operand 8 states and 191 transitions. [2025-01-10 06:48:28,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 331 flow [2025-01-10 06:48:28,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 78 transitions, 326 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:48:28,003 INFO L231 Difference]: Finished difference. Result has 57 places, 36 transitions, 100 flow [2025-01-10 06:48:28,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=57, PETRI_TRANSITIONS=36} [2025-01-10 06:48:28,007 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2025-01-10 06:48:28,007 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 36 transitions, 100 flow [2025-01-10 06:48:28,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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:48:28,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:28,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:28,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:48:28,008 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:48:28,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:28,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1111507631, now seen corresponding path program 1 times [2025-01-10 06:48:28,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:28,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684936755] [2025-01-10 06:48:28,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:28,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:28,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:48:28,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:48:28,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:28,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:28,088 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:48:28,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:28,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684936755] [2025-01-10 06:48:28,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684936755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:28,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:28,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:48:28,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031913992] [2025-01-10 06:48:28,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:28,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:48:28,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:28,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:48:28,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:48:28,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2025-01-10 06:48:28,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 36 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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:48:28,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:28,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2025-01-10 06:48:28,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:28,201 INFO L124 PetriNetUnfolderBase]: 95/258 cut-off events. [2025-01-10 06:48:28,202 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-01-10 06:48:28,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 258 events. 95/258 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 966 event pairs, 42 based on Foata normal form. 11/267 useless extension candidates. Maximal degree in co-relation 538. Up to 103 conditions per place. [2025-01-10 06:48:28,203 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 38 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2025-01-10 06:48:28,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 224 flow [2025-01-10 06:48:28,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:48:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:48:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-01-10 06:48:28,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2025-01-10 06:48:28,204 INFO L175 Difference]: Start difference. First operand has 57 places, 36 transitions, 100 flow. Second operand 6 states and 118 transitions. [2025-01-10 06:48:28,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 224 flow [2025-01-10 06:48:28,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 204 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-01-10 06:48:28,206 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 95 flow [2025-01-10 06:48:28,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=95, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-01-10 06:48:28,206 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2025-01-10 06:48:28,207 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 95 flow [2025-01-10 06:48:28,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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:48:28,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:28,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:28,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:48:28,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:48:28,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:28,208 INFO L85 PathProgramCache]: Analyzing trace with hash -96997753, now seen corresponding path program 1 times [2025-01-10 06:48:28,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:28,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696086559] [2025-01-10 06:48:28,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:28,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:28,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 06:48:28,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:48:28,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:28,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:28,266 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:48:28,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:28,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696086559] [2025-01-10 06:48:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696086559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:28,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:28,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:48:28,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366017706] [2025-01-10 06:48:28,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:28,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:48:28,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:28,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:48:28,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:48:28,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2025-01-10 06:48:28,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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:48:28,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:28,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2025-01-10 06:48:28,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:28,402 INFO L124 PetriNetUnfolderBase]: 85/252 cut-off events. [2025-01-10 06:48:28,402 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 06:48:28,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 252 events. 85/252 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 945 event pairs, 36 based on Foata normal form. 11/261 useless extension candidates. Maximal degree in co-relation 504. Up to 108 conditions per place. [2025-01-10 06:48:28,404 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 31 selfloop transitions, 5 changer transitions 14/60 dead transitions. [2025-01-10 06:48:28,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 247 flow [2025-01-10 06:48:28,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:48:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:48:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2025-01-10 06:48:28,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.541033434650456 [2025-01-10 06:48:28,405 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 95 flow. Second operand 7 states and 178 transitions. [2025-01-10 06:48:28,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 247 flow [2025-01-10 06:48:28,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:48:28,406 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 114 flow [2025-01-10 06:48:28,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=114, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2025-01-10 06:48:28,407 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2025-01-10 06:48:28,407 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 114 flow [2025-01-10 06:48:28,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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:48:28,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:28,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:28,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:48:28,407 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:48:28,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1763443410, now seen corresponding path program 1 times [2025-01-10 06:48:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:28,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711664376] [2025-01-10 06:48:28,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:28,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:28,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:48:28,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:48:28,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:28,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:28,552 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:48:28,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:28,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711664376] [2025-01-10 06:48:28,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711664376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:28,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:28,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:48:28,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476802955] [2025-01-10 06:48:28,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:28,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:48:28,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:28,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:48:28,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:48:28,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2025-01-10 06:48:28,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:48:28,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:28,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2025-01-10 06:48:28,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:28,627 INFO L124 PetriNetUnfolderBase]: 69/208 cut-off events. [2025-01-10 06:48:28,628 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-01-10 06:48:28,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 208 events. 69/208 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 703 event pairs, 23 based on Foata normal form. 7/213 useless extension candidates. Maximal degree in co-relation 490. Up to 91 conditions per place. [2025-01-10 06:48:28,629 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 34 selfloop transitions, 7 changer transitions 2/53 dead transitions. [2025-01-10 06:48:28,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 256 flow [2025-01-10 06:48:28,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:48:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:48:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-01-10 06:48:28,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6063829787234043 [2025-01-10 06:48:28,630 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 114 flow. Second operand 4 states and 114 transitions. [2025-01-10 06:48:28,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 256 flow [2025-01-10 06:48:28,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 230 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 06:48:28,632 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 122 flow [2025-01-10 06:48:28,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-01-10 06:48:28,633 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2025-01-10 06:48:28,633 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 122 flow [2025-01-10 06:48:28,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:48:28,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:28,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:28,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:48:28,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:48:28,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1457063391, now seen corresponding path program 1 times [2025-01-10 06:48:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:28,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253107391] [2025-01-10 06:48:28,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:28,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:28,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:48:28,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:48:28,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:28,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:28,838 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:48:28,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:28,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253107391] [2025-01-10 06:48:28,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253107391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:28,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:28,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:48:28,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161165635] [2025-01-10 06:48:28,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:28,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:48:28,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:28,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:48:28,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:48:28,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2025-01-10 06:48:28,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:48:28,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:28,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2025-01-10 06:48:28,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:28,898 INFO L124 PetriNetUnfolderBase]: 70/210 cut-off events. [2025-01-10 06:48:28,898 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-01-10 06:48:28,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 210 events. 70/210 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 716 event pairs, 31 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 488. Up to 102 conditions per place. [2025-01-10 06:48:28,899 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 33 selfloop transitions, 6 changer transitions 0/49 dead transitions. [2025-01-10 06:48:28,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 236 flow [2025-01-10 06:48:28,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:48:28,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:48:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-01-10 06:48:28,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5797872340425532 [2025-01-10 06:48:28,900 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 122 flow. Second operand 4 states and 109 transitions. [2025-01-10 06:48:28,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 236 flow [2025-01-10 06:48:28,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:48:28,902 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 149 flow [2025-01-10 06:48:28,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-01-10 06:48:28,902 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2025-01-10 06:48:28,902 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 149 flow [2025-01-10 06:48:28,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:48:28,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:28,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:28,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:48:28,903 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-10 06:48:28,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:28,903 INFO L85 PathProgramCache]: Analyzing trace with hash -236367315, now seen corresponding path program 1 times [2025-01-10 06:48:28,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:28,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112991499] [2025-01-10 06:48:28,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:28,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:28,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 06:48:28,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 06:48:28,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:28,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:48:28,919 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:48:28,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 06:48:28,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 06:48:28,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:28,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:48:28,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:48:28,948 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:48:28,949 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2025-01-10 06:48:28,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2025-01-10 06:48:28,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 7 remaining) [2025-01-10 06:48:28,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-10 06:48:28,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2025-01-10 06:48:28,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2025-01-10 06:48:28,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2025-01-10 06:48:28,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:48:28,952 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:28,977 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:48:28,977 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:48:28,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:48:28 BasicIcfg [2025-01-10 06:48:28,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:48:28,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:48:28,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:48:28,981 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:48:28,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:48:26" (3/4) ... [2025-01-10 06:48:28,983 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 06:48:29,025 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-10 06:48:29,061 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:48:29,061 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:48:29,061 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:48:29,061 INFO L158 Benchmark]: Toolchain (without parser) took 3808.85ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.9MB in the beginning and 108.5MB in the end (delta: 4.4MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2025-01-10 06:48:29,062 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:48:29,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.37ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 92.4MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:48:29,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.09ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:48:29,062 INFO L158 Benchmark]: Boogie Preprocessor took 52.75ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 89.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:48:29,062 INFO L158 Benchmark]: RCFGBuilder took 539.52ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 47.6MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-10 06:48:29,062 INFO L158 Benchmark]: TraceAbstraction took 2707.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 47.1MB in the beginning and 116.9MB in the end (delta: -69.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:48:29,065 INFO L158 Benchmark]: Witness Printer took 79.70ms. Allocated memory is still 176.2MB. Free memory was 116.9MB in the beginning and 108.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:48:29,067 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.37ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 92.4MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.09ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.75ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 89.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 539.52ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 47.6MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2707.15ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 47.1MB in the beginning and 116.9MB in the end (delta: -69.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 79.70ms. Allocated memory is still 176.2MB. Free memory was 116.9MB in the beginning and 108.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 701]: integer overflow possible integer overflow possible We found a FailurePath: [L682] 0 int g = 0; [L683] 0 int h = 0; [L684] 0 int i = 0; [L685] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L685] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L685] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L685] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L685] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L685] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L686] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L686] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L686] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L686] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L686] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L686] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L687] 0 pthread_mutex_t C = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L687] 0 pthread_mutex_t C = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L687] 0 pthread_mutex_t C = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L687] 0 pthread_mutex_t C = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L687] 0 pthread_mutex_t C = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L687] 0 pthread_mutex_t C = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L710] 0 int x = __VERIFIER_nondet_int(); [L711] COND TRUE 0 x > -1000 [L712] 0 pthread_t id; [L713] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, B={4:0}, C={5:0}, g=0, h=0, i=0, id=-1, x=2147483617] [L689] 1 int x = __VERIFIER_nondet_int(); [L690] 1 int y = __VERIFIER_nondet_int(); [L691] 1 int z = __VERIFIER_nondet_int(); [L692] COND TRUE 1 x < 1000 VAL [A={3:0}, B={4:0}, C={5:0}, \old(arg)={0:0}, arg={0:0}, g=0, h=0, i=0, x=0, y=0, z=0] [L716] 0 i = 11 [L717] 0 g = x VAL [A={3:0}, B={4:0}, C={5:0}, g=2147483617, h=0, i=11, id=-1, x=2147483617] [L718] EXPR 0 x - 17 [L718] 0 h = x - 17 VAL [A={3:0}, B={4:0}, C={5:0}, g=2147483617, h=2147483600, i=11, id=-1, x=2147483617] [L721] 0 h = x VAL [A={3:0}, B={4:0}, C={5:0}, g=2147483617, h=2147483617, i=11, id=-1, x=2147483617] [L695] 1 x = g [L696] 1 y = h [L697] CALL 1 __VERIFIER_assert(y <= x) [L19] COND FALSE 1 !(!(cond)) [L697] RET 1 __VERIFIER_assert(y <= x) [L699] CALL 1 __VERIFIER_assert(x == y) [L19] COND FALSE 1 !(!(cond)) [L699] RET 1 __VERIFIER_assert(x == y) [L701] 1 x + 31 VAL [A={3:0}, B={4:0}, C={5:0}, \old(arg)={0:0}, arg={0:0}, g=2147483617, h=2147483617, i=11, x=2147483617, y=2147483617, z=0] - UnprovableResult [Line: 718]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 67 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 401 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 344 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 865 IncrementalHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 8 mSDtfsCounter, 865 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=9, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-10 06:48:29,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)