./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_51-mutex_ptr.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/04-mutex_51-mutex_ptr.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 676d96662ae61a9d27f232e6ef1f1837cf504ffa210b7be2fd6286f04a0fe098 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:43:55,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:43:55,679 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:43:55,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:43:55,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:43:55,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:43:55,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:43:55,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:43:55,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:43:55,697 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:43:55,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:43:55,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:43:55,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:43:55,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:43:55,698 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:43:55,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:43:55,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:43:55,698 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:43:55,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:43:55,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:43:55,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:43:55,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:43:55,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:43:55,699 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:43:55,699 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:43:55,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:43:55,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:43:55,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:43:55,700 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:43:55,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:43:55,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:43:55,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:43:55,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:43:55,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:43:55,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:43:55,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:43:55,700 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 -> 676d96662ae61a9d27f232e6ef1f1837cf504ffa210b7be2fd6286f04a0fe098 [2025-01-10 06:43:55,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:43:55,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:43:55,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:43:55,897 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:43:55,898 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:43:55,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_51-mutex_ptr.i [2025-01-10 06:43:57,047 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/517aa2dac/24c61ef78af248b590e3302bc406ada7/FLAG397384546 [2025-01-10 06:43:57,386 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:43:57,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_51-mutex_ptr.i [2025-01-10 06:43:57,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/517aa2dac/24c61ef78af248b590e3302bc406ada7/FLAG397384546 [2025-01-10 06:43:57,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/517aa2dac/24c61ef78af248b590e3302bc406ada7 [2025-01-10 06:43:57,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:43:57,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:43:57,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:43:57,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:43:57,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:43:57,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:43:57" (1/1) ... [2025-01-10 06:43:57,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139279b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:57, skipping insertion in model container [2025-01-10 06:43:57,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:43:57" (1/1) ... [2025-01-10 06:43:57,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:43:57,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:43:57,986 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:43:58,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:43:58,053 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:43:58,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:58 WrapperNode [2025-01-10 06:43:58,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:43:58,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:43:58,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:43:58,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:43:58,060 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:43:58" (1/1) ... [2025-01-10 06:43:58,072 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:43:58" (1/1) ... [2025-01-10 06:43:58,089 INFO L138 Inliner]: procedures = 262, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 94 [2025-01-10 06:43:58,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:43:58,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:43:58,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:43:58,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:43:58,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:58" (1/1) ... [2025-01-10 06:43:58,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:58" (1/1) ... [2025-01-10 06:43:58,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:58" (1/1) ... [2025-01-10 06:43:58,111 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [5, 5]. 50 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [5, 1]. The 2 writes are split as follows [0, 2]. [2025-01-10 06:43:58,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:58" (1/1) ... [2025-01-10 06:43:58,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:58" (1/1) ... [2025-01-10 06:43:58,120 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:58" (1/1) ... [2025-01-10 06:43:58,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:58" (1/1) ... [2025-01-10 06:43:58,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:58" (1/1) ... [2025-01-10 06:43:58,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:58" (1/1) ... [2025-01-10 06:43:58,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:58" (1/1) ... [2025-01-10 06:43:58,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:43:58,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:43:58,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:43:58,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:43:58,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:58" (1/1) ... [2025-01-10 06:43:58,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:43:58,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:43:58,161 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:43:58,163 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:43:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:43:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:43:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:43:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:43:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:43:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:43:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:43:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:43:58,178 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:43:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:43:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:43:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:43:58,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:43:58,179 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:43:58,277 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:43:58,283 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:43:58,522 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:43:58,522 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:43:58,790 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:43:58,790 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:43:58,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:43:58 BoogieIcfgContainer [2025-01-10 06:43:58,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:43:58,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:43:58,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:43:58,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:43:58,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:43:57" (1/3) ... [2025-01-10 06:43:58,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3360af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:43:58, skipping insertion in model container [2025-01-10 06:43:58,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:43:58" (2/3) ... [2025-01-10 06:43:58,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3360af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:43:58, skipping insertion in model container [2025-01-10 06:43:58,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:43:58" (3/3) ... [2025-01-10 06:43:58,800 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_51-mutex_ptr.i [2025-01-10 06:43:58,812 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:43:58,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_51-mutex_ptr.i that has 2 procedures, 24 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-10 06:43:58,813 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:43:58,854 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:43:58,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 23 transitions, 53 flow [2025-01-10 06:43:58,906 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-01-10 06:43:58,908 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:43:58,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 22 events. 0/22 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-01-10 06:43:58,911 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 23 transitions, 53 flow [2025-01-10 06:43:58,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 43 flow [2025-01-10 06:43:58,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:43:58,934 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;@484f1190, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:43:58,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 06:43:58,938 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:43:58,938 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-10 06:43:58,938 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:43:58,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:58,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:43:58,939 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:43:58,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:58,943 INFO L85 PathProgramCache]: Analyzing trace with hash -643345928, now seen corresponding path program 1 times [2025-01-10 06:43:58,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:58,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470126611] [2025-01-10 06:43:58,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:58,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:59,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:43:59,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:43:59,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:59,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:59,157 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:43:59,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:59,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470126611] [2025-01-10 06:43:59,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470126611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:59,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:59,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:43:59,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881911690] [2025-01-10 06:43:59,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:59,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:43:59,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:59,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:43:59,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:43:59,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-01-10 06:43:59,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 43 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:43:59,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:59,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-01-10 06:43:59,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:59,267 INFO L124 PetriNetUnfolderBase]: 36/108 cut-off events. [2025-01-10 06:43:59,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:43:59,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 108 events. 36/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 359 event pairs, 15 based on Foata normal form. 7/109 useless extension candidates. Maximal degree in co-relation 192. Up to 60 conditions per place. [2025-01-10 06:43:59,269 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 20 selfloop transitions, 4 changer transitions 6/35 dead transitions. [2025-01-10 06:43:59,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 133 flow [2025-01-10 06:43:59,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:43:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:43:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-01-10 06:43:59,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5565217391304348 [2025-01-10 06:43:59,278 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 43 flow. Second operand 5 states and 64 transitions. [2025-01-10 06:43:59,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 133 flow [2025-01-10 06:43:59,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 35 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:43:59,282 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 67 flow [2025-01-10 06:43:59,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2025-01-10 06:43:59,285 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places. [2025-01-10 06:43:59,285 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 67 flow [2025-01-10 06:43:59,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:43:59,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:59,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:43:59,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:43:59,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:43:59,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:59,286 INFO L85 PathProgramCache]: Analyzing trace with hash -642789097, now seen corresponding path program 1 times [2025-01-10 06:43:59,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:59,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123760311] [2025-01-10 06:43:59,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:59,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:59,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:43:59,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:43:59,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:59,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:59,438 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:43:59,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:59,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123760311] [2025-01-10 06:43:59,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123760311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:59,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:59,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:43:59,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109974537] [2025-01-10 06:43:59,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:59,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:43:59,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:59,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:43:59,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:43:59,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-01-10 06:43:59,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:43:59,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:59,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-01-10 06:43:59,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:59,530 INFO L124 PetriNetUnfolderBase]: 24/87 cut-off events. [2025-01-10 06:43:59,530 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-10 06:43:59,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 87 events. 24/87 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 288 event pairs, 5 based on Foata normal form. 12/99 useless extension candidates. Maximal degree in co-relation 187. Up to 40 conditions per place. [2025-01-10 06:43:59,531 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 21 selfloop transitions, 6 changer transitions 3/35 dead transitions. [2025-01-10 06:43:59,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 169 flow [2025-01-10 06:43:59,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:43:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:43:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2025-01-10 06:43:59,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2025-01-10 06:43:59,533 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 67 flow. Second operand 6 states and 70 transitions. [2025-01-10 06:43:59,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 169 flow [2025-01-10 06:43:59,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 160 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 06:43:59,534 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 100 flow [2025-01-10 06:43:59,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2025-01-10 06:43:59,535 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 12 predicate places. [2025-01-10 06:43:59,535 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 100 flow [2025-01-10 06:43:59,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:43:59,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:59,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:59,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:43:59,535 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:43:59,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:59,535 INFO L85 PathProgramCache]: Analyzing trace with hash 105231742, now seen corresponding path program 1 times [2025-01-10 06:43:59,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:59,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453445260] [2025-01-10 06:43:59,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:59,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:59,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:43:59,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:43:59,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:59,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:59,658 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:43:59,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:59,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453445260] [2025-01-10 06:43:59,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453445260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:59,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:59,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:43:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283721167] [2025-01-10 06:43:59,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:59,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:43:59,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:59,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:43:59,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:43:59,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 23 [2025-01-10 06:43:59,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:43:59,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:59,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 23 [2025-01-10 06:43:59,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:43:59,711 INFO L124 PetriNetUnfolderBase]: 12/56 cut-off events. [2025-01-10 06:43:59,711 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-10 06:43:59,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 56 events. 12/56 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 132 event pairs, 3 based on Foata normal form. 6/62 useless extension candidates. Maximal degree in co-relation 136. Up to 26 conditions per place. [2025-01-10 06:43:59,712 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 17 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2025-01-10 06:43:59,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 156 flow [2025-01-10 06:43:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:43:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:43:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-01-10 06:43:59,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2025-01-10 06:43:59,713 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 100 flow. Second operand 3 states and 42 transitions. [2025-01-10 06:43:59,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 156 flow [2025-01-10 06:43:59,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 148 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 06:43:59,714 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 100 flow [2025-01-10 06:43:59,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2025-01-10 06:43:59,715 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2025-01-10 06:43:59,715 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 100 flow [2025-01-10 06:43:59,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:43:59,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:43:59,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:43:59,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:43:59,715 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:43:59,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:43:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1792152414, now seen corresponding path program 1 times [2025-01-10 06:43:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:43:59,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686812680] [2025-01-10 06:43:59,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:43:59,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:43:59,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:43:59,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:43:59,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:43:59,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:43:59,906 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:43:59,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:43:59,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686812680] [2025-01-10 06:43:59,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686812680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:43:59,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:43:59,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:43:59,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527769618] [2025-01-10 06:43:59,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:43:59,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:43:59,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:43:59,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:43:59,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:43:59,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-01-10 06:43:59,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 100 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:43:59,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:43:59,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-01-10 06:43:59,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:00,150 INFO L124 PetriNetUnfolderBase]: 13/65 cut-off events. [2025-01-10 06:44:00,151 INFO L125 PetriNetUnfolderBase]: For 39/41 co-relation queries the response was YES. [2025-01-10 06:44:00,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 65 events. 13/65 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 182 event pairs, 4 based on Foata normal form. 3/68 useless extension candidates. Maximal degree in co-relation 167. Up to 31 conditions per place. [2025-01-10 06:44:00,152 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 23 selfloop transitions, 9 changer transitions 0/35 dead transitions. [2025-01-10 06:44:00,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 208 flow [2025-01-10 06:44:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:44:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:44:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2025-01-10 06:44:00,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3532608695652174 [2025-01-10 06:44:00,153 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 100 flow. Second operand 8 states and 65 transitions. [2025-01-10 06:44:00,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 208 flow [2025-01-10 06:44:00,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:44:00,154 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 154 flow [2025-01-10 06:44:00,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=154, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2025-01-10 06:44:00,155 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 21 predicate places. [2025-01-10 06:44:00,155 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 154 flow [2025-01-10 06:44:00,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:00,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:00,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:00,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:44:00,156 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:44:00,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:00,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1035434260, now seen corresponding path program 2 times [2025-01-10 06:44:00,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:00,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94521337] [2025-01-10 06:44:00,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:44:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:00,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:44:00,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:44:00,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:44:00,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:00,383 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:44:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94521337] [2025-01-10 06:44:00,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94521337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:00,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:00,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:44:00,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834106801] [2025-01-10 06:44:00,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:00,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:44:00,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:00,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:44:00,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:44:00,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-01-10 06:44:00,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:00,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:00,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-01-10 06:44:00,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:00,713 INFO L124 PetriNetUnfolderBase]: 12/71 cut-off events. [2025-01-10 06:44:00,713 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-01-10 06:44:00,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 71 events. 12/71 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 235 event pairs, 9 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 197. Up to 34 conditions per place. [2025-01-10 06:44:00,714 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 22 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2025-01-10 06:44:00,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 36 transitions, 256 flow [2025-01-10 06:44:00,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:44:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:44:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2025-01-10 06:44:00,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33695652173913043 [2025-01-10 06:44:00,716 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 154 flow. Second operand 8 states and 62 transitions. [2025-01-10 06:44:00,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 36 transitions, 256 flow [2025-01-10 06:44:00,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 36 transitions, 250 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:44:00,720 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 214 flow [2025-01-10 06:44:00,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=214, PETRI_PLACES=55, PETRI_TRANSITIONS=31} [2025-01-10 06:44:00,721 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 31 predicate places. [2025-01-10 06:44:00,722 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 31 transitions, 214 flow [2025-01-10 06:44:00,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:00,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:00,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:00,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:44:00,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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:44:00,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1346336972, now seen corresponding path program 1 times [2025-01-10 06:44:00,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:00,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026187275] [2025-01-10 06:44:00,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:00,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:00,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:44:00,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:44:00,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:00,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:00,914 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:44:00,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:00,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026187275] [2025-01-10 06:44:00,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026187275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:00,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:00,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:44:00,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134291215] [2025-01-10 06:44:00,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:00,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:44:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:00,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:44:00,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:44:00,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-01-10 06:44:00,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 31 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:00,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:00,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-01-10 06:44:00,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:01,012 INFO L124 PetriNetUnfolderBase]: 11/68 cut-off events. [2025-01-10 06:44:01,013 INFO L125 PetriNetUnfolderBase]: For 183/185 co-relation queries the response was YES. [2025-01-10 06:44:01,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 68 events. 11/68 cut-off events. For 183/185 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 221 event pairs, 2 based on Foata normal form. 4/72 useless extension candidates. Maximal degree in co-relation 211. Up to 20 conditions per place. [2025-01-10 06:44:01,013 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 25 selfloop transitions, 9 changer transitions 0/37 dead transitions. [2025-01-10 06:44:01,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 37 transitions, 295 flow [2025-01-10 06:44:01,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:44:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:44:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2025-01-10 06:44:01,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35403726708074534 [2025-01-10 06:44:01,015 INFO L175 Difference]: Start difference. First operand has 55 places, 31 transitions, 214 flow. Second operand 7 states and 57 transitions. [2025-01-10 06:44:01,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 37 transitions, 295 flow [2025-01-10 06:44:01,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 37 transitions, 282 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 06:44:01,017 INFO L231 Difference]: Finished difference. Result has 58 places, 30 transitions, 215 flow [2025-01-10 06:44:01,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=215, PETRI_PLACES=58, PETRI_TRANSITIONS=30} [2025-01-10 06:44:01,018 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 34 predicate places. [2025-01-10 06:44:01,018 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 30 transitions, 215 flow [2025-01-10 06:44:01,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:01,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:01,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:01,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:44:01,018 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:44:01,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1062545244, now seen corresponding path program 3 times [2025-01-10 06:44:01,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:01,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174655211] [2025-01-10 06:44:01,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:44:01,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:01,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:44:01,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:44:01,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:44:01,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:01,130 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:44:01,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:01,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174655211] [2025-01-10 06:44:01,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174655211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:01,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:01,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:44:01,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331460090] [2025-01-10 06:44:01,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:01,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:44:01,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:01,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:44:01,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:44:01,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-01-10 06:44:01,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 30 transitions, 215 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:01,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:01,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-01-10 06:44:01,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:01,249 INFO L124 PetriNetUnfolderBase]: 11/66 cut-off events. [2025-01-10 06:44:01,252 INFO L125 PetriNetUnfolderBase]: For 196/198 co-relation queries the response was YES. [2025-01-10 06:44:01,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 66 events. 11/66 cut-off events. For 196/198 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 206 event pairs, 7 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 214. Up to 19 conditions per place. [2025-01-10 06:44:01,253 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 20 selfloop transitions, 11 changer transitions 0/34 dead transitions. [2025-01-10 06:44:01,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 34 transitions, 283 flow [2025-01-10 06:44:01,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:44:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:44:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2025-01-10 06:44:01,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32065217391304346 [2025-01-10 06:44:01,258 INFO L175 Difference]: Start difference. First operand has 58 places, 30 transitions, 215 flow. Second operand 8 states and 59 transitions. [2025-01-10 06:44:01,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 34 transitions, 283 flow [2025-01-10 06:44:01,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 34 transitions, 252 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-01-10 06:44:01,260 INFO L231 Difference]: Finished difference. Result has 56 places, 29 transitions, 198 flow [2025-01-10 06:44:01,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=198, PETRI_PLACES=56, PETRI_TRANSITIONS=29} [2025-01-10 06:44:01,261 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 32 predicate places. [2025-01-10 06:44:01,261 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 29 transitions, 198 flow [2025-01-10 06:44:01,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:01,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:01,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:01,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:44:01,266 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:44:01,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:01,266 INFO L85 PathProgramCache]: Analyzing trace with hash -277849730, now seen corresponding path program 1 times [2025-01-10 06:44:01,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:01,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352161627] [2025-01-10 06:44:01,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:01,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:01,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:44:01,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:44:01,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:01,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:01,439 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:44:01,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:01,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352161627] [2025-01-10 06:44:01,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352161627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:01,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:01,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:44:01,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526923486] [2025-01-10 06:44:01,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:01,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:44:01,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:01,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:44:01,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:44:01,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-01-10 06:44:01,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 29 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:01,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:01,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-01-10 06:44:01,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:01,547 INFO L124 PetriNetUnfolderBase]: 11/66 cut-off events. [2025-01-10 06:44:01,548 INFO L125 PetriNetUnfolderBase]: For 172/174 co-relation queries the response was YES. [2025-01-10 06:44:01,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 66 events. 11/66 cut-off events. For 172/174 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 208 event pairs, 4 based on Foata normal form. 3/69 useless extension candidates. Maximal degree in co-relation 201. Up to 32 conditions per place. [2025-01-10 06:44:01,550 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 20 selfloop transitions, 7 changer transitions 6/36 dead transitions. [2025-01-10 06:44:01,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 36 transitions, 276 flow [2025-01-10 06:44:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:44:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:44:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2025-01-10 06:44:01,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3423913043478261 [2025-01-10 06:44:01,551 INFO L175 Difference]: Start difference. First operand has 56 places, 29 transitions, 198 flow. Second operand 8 states and 63 transitions. [2025-01-10 06:44:01,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 36 transitions, 276 flow [2025-01-10 06:44:01,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 36 transitions, 238 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-01-10 06:44:01,552 INFO L231 Difference]: Finished difference. Result has 55 places, 25 transitions, 141 flow [2025-01-10 06:44:01,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=25} [2025-01-10 06:44:01,553 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 31 predicate places. [2025-01-10 06:44:01,553 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 25 transitions, 141 flow [2025-01-10 06:44:01,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:01,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:01,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:01,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:44:01,554 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:44:01,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:01,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1213227105, now seen corresponding path program 1 times [2025-01-10 06:44:01,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:01,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52507157] [2025-01-10 06:44:01,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:44:01,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:01,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:44:01,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:44:01,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:44:01,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:01,675 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:44:01,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:01,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52507157] [2025-01-10 06:44:01,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52507157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:01,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:01,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:44:01,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903397104] [2025-01-10 06:44:01,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:01,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:44:01,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:01,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:44:01,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:44:01,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-01-10 06:44:01,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 25 transitions, 141 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:01,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:01,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-01-10 06:44:01,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:01,763 INFO L124 PetriNetUnfolderBase]: 10/55 cut-off events. [2025-01-10 06:44:01,763 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-01-10 06:44:01,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 55 events. 10/55 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 143 event pairs, 2 based on Foata normal form. 2/57 useless extension candidates. Maximal degree in co-relation 158. Up to 14 conditions per place. [2025-01-10 06:44:01,764 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 10 selfloop transitions, 5 changer transitions 13/31 dead transitions. [2025-01-10 06:44:01,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 31 transitions, 210 flow [2025-01-10 06:44:01,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:44:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:44:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2025-01-10 06:44:01,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30434782608695654 [2025-01-10 06:44:01,765 INFO L175 Difference]: Start difference. First operand has 55 places, 25 transitions, 141 flow. Second operand 9 states and 63 transitions. [2025-01-10 06:44:01,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 31 transitions, 210 flow [2025-01-10 06:44:01,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 31 transitions, 183 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 06:44:01,766 INFO L231 Difference]: Finished difference. Result has 49 places, 18 transitions, 92 flow [2025-01-10 06:44:01,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=92, PETRI_PLACES=49, PETRI_TRANSITIONS=18} [2025-01-10 06:44:01,766 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 25 predicate places. [2025-01-10 06:44:01,766 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 18 transitions, 92 flow [2025-01-10 06:44:01,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:01,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:01,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:01,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:44:01,767 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:44:01,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2033690704, now seen corresponding path program 2 times [2025-01-10 06:44:01,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:01,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144296052] [2025-01-10 06:44:01,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:44:01,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:01,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:44:01,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:44:01,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:44:01,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:01,884 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:44:01,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:01,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144296052] [2025-01-10 06:44:01,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144296052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:01,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:01,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:44:01,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499218895] [2025-01-10 06:44:01,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:01,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:44:01,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:01,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:44:01,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:44:01,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-01-10 06:44:01,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 18 transitions, 92 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:01,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:01,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-01-10 06:44:01,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:01,953 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-01-10 06:44:01,953 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-10 06:44:01,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 24 events. 1/24 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 29 event pairs, 1 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 63. Up to 9 conditions per place. [2025-01-10 06:44:01,953 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 8 selfloop transitions, 3 changer transitions 5/19 dead transitions. [2025-01-10 06:44:01,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 19 transitions, 123 flow [2025-01-10 06:44:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:44:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:44:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2025-01-10 06:44:01,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2795031055900621 [2025-01-10 06:44:01,954 INFO L175 Difference]: Start difference. First operand has 49 places, 18 transitions, 92 flow. Second operand 7 states and 45 transitions. [2025-01-10 06:44:01,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 19 transitions, 123 flow [2025-01-10 06:44:01,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 19 transitions, 96 flow, removed 1 selfloop flow, removed 10 redundant places. [2025-01-10 06:44:01,955 INFO L231 Difference]: Finished difference. Result has 34 places, 14 transitions, 51 flow [2025-01-10 06:44:01,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=51, PETRI_PLACES=34, PETRI_TRANSITIONS=14} [2025-01-10 06:44:01,955 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2025-01-10 06:44:01,955 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 14 transitions, 51 flow [2025-01-10 06:44:01,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:01,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:44:01,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:44:01,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:44:01,956 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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:44:01,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:44:01,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1420836088, now seen corresponding path program 3 times [2025-01-10 06:44:01,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:44:01,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520207750] [2025-01-10 06:44:01,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 06:44:01,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:44:01,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:44:01,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:44:01,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 06:44:01,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:44:02,035 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:44:02,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:44:02,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520207750] [2025-01-10 06:44:02,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520207750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:44:02,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:44:02,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:44:02,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063262595] [2025-01-10 06:44:02,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:44:02,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:44:02,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:44:02,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:44:02,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:44:02,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-01-10 06:44:02,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 14 transitions, 51 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:02,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:44:02,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-01-10 06:44:02,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:44:02,091 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-01-10 06:44:02,091 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 06:44:02,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 15 events. 1/15 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 1/16 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2025-01-10 06:44:02,091 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2025-01-10 06:44:02,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 14 transitions, 71 flow [2025-01-10 06:44:02,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:44:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:44:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2025-01-10 06:44:02,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2484472049689441 [2025-01-10 06:44:02,092 INFO L175 Difference]: Start difference. First operand has 34 places, 14 transitions, 51 flow. Second operand 7 states and 40 transitions. [2025-01-10 06:44:02,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 14 transitions, 71 flow [2025-01-10 06:44:02,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 14 transitions, 57 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 06:44:02,092 INFO L231 Difference]: Finished difference. Result has 24 places, 0 transitions, 0 flow [2025-01-10 06:44:02,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=24, PETRI_TRANSITIONS=0} [2025-01-10 06:44:02,092 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2025-01-10 06:44:02,093 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 0 transitions, 0 flow [2025-01-10 06:44:02,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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:44:02,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2025-01-10 06:44:02,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2025-01-10 06:44:02,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-01-10 06:44:02,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2025-01-10 06:44:02,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2025-01-10 06:44:02,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2025-01-10 06:44:02,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2025-01-10 06:44:02,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:44:02,096 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2025-01-10 06:44:02,099 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:44:02,099 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:44:02,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:44:02 BasicIcfg [2025-01-10 06:44:02,102 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:44:02,102 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:44:02,102 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:44:02,102 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:44:02,103 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:43:58" (3/4) ... [2025-01-10 06:44:02,104 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:44:02,105 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-01-10 06:44:02,108 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 81 nodes and edges [2025-01-10 06:44:02,108 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-10 06:44:02,108 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 06:44:02,109 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 06:44:02,156 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:44:02,156 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:44:02,156 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:44:02,157 INFO L158 Benchmark]: Toolchain (without parser) took 4499.06ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 107.9MB in the beginning and 175.4MB in the end (delta: -67.5MB). Peak memory consumption was 173.1MB. Max. memory is 16.1GB. [2025-01-10 06:44:02,157 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:44:02,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.69ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 80.5MB in the end (delta: 27.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:44:02,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.94ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 78.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:44:02,157 INFO L158 Benchmark]: Boogie Preprocessor took 44.00ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 76.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:44:02,157 INFO L158 Benchmark]: RCFGBuilder took 655.96ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 92.3MB in the end (delta: -16.0MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2025-01-10 06:44:02,158 INFO L158 Benchmark]: TraceAbstraction took 3309.90ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 91.5MB in the beginning and 183.5MB in the end (delta: -92.0MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. [2025-01-10 06:44:02,158 INFO L158 Benchmark]: Witness Printer took 53.91ms. Allocated memory is still 385.9MB. Free memory was 183.5MB in the beginning and 175.4MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:44:02,159 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.28ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.69ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 80.5MB in the end (delta: 27.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.94ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 78.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.00ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 76.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 655.96ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 92.3MB in the end (delta: -16.0MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3309.90ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 91.5MB in the beginning and 183.5MB in the end (delta: -92.0MB). Peak memory consumption was 149.9MB. Max. memory is 16.1GB. * Witness Printer took 53.91ms. Allocated memory is still 385.9MB. Free memory was 183.5MB in the beginning and 175.4MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 937]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 937]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 926]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 926]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 35 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: 3.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 319 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1014 IncrementalHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 23 mSDtfsCounter, 1014 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=6, InterpolantAutomatonStates: 76, 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, 1.3s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:44:02,171 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 Result: TRUE