./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4017723c7e4b1f7c431c7e7a6ea6ca9df8ac56fc590cd03021a11577cb455eff --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:56:29,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:56:29,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:56:29,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:56:29,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:56:29,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:56:29,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:56:29,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:56:29,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:56:29,789 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:56:29,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:56:29,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:56:29,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:56:29,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:56:29,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:56:29,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:56:29,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:56:29,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:56:29,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:56:29,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:56:29,792 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:56:29,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:56:29,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:56:29,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:56:29,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:56:29,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:56:29,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:56:29,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:56:29,792 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/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 ! call(reach_error())) ) 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 -> 4017723c7e4b1f7c431c7e7a6ea6ca9df8ac56fc590cd03021a11577cb455eff [2025-03-14 00:56:30,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:56:30,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:56:30,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:56:30,076 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:56:30,076 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:56:30,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i [2025-03-14 00:56:31,186 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315ec834b/c0d62189b327455dae2a974d707fb865/FLAG20f935d0e [2025-03-14 00:56:31,458 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:56:31,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i [2025-03-14 00:56:31,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315ec834b/c0d62189b327455dae2a974d707fb865/FLAG20f935d0e [2025-03-14 00:56:31,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315ec834b/c0d62189b327455dae2a974d707fb865 [2025-03-14 00:56:31,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:56:31,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:56:31,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:56:31,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:56:31,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:56:31,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:56:31" (1/1) ... [2025-03-14 00:56:31,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce8138e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:31, skipping insertion in model container [2025-03-14 00:56:31,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:56:31" (1/1) ... [2025-03-14 00:56:31,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:56:31,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i[1086,1099] [2025-03-14 00:56:32,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:56:32,033 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:56:32,041 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i[1086,1099] [2025-03-14 00:56:32,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:56:32,092 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:56:32,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:32 WrapperNode [2025-03-14 00:56:32,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:56:32,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:56:32,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:56:32,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:56:32,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:32" (1/1) ... [2025-03-14 00:56:32,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:32" (1/1) ... [2025-03-14 00:56:32,119 INFO L138 Inliner]: procedures = 162, calls = 21, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 75 [2025-03-14 00:56:32,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:56:32,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:56:32,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:56:32,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:56:32,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:32" (1/1) ... [2025-03-14 00:56:32,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:32" (1/1) ... [2025-03-14 00:56:32,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:32" (1/1) ... [2025-03-14 00:56:32,134 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-03-14 00:56:32,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:32" (1/1) ... [2025-03-14 00:56:32,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:32" (1/1) ... [2025-03-14 00:56:32,137 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:32" (1/1) ... [2025-03-14 00:56:32,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:32" (1/1) ... [2025-03-14 00:56:32,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:32" (1/1) ... [2025-03-14 00:56:32,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:32" (1/1) ... [2025-03-14 00:56:32,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:56:32,141 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:56:32,141 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:56:32,141 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:56:32,142 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:32" (1/1) ... [2025-03-14 00:56:32,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:56:32,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:56:32,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 00:56:32,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 00:56:32,181 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 00:56:32,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:56:32,181 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 00:56:32,181 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 00:56:32,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:56:32,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:56:32,181 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 00:56:32,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:56:32,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:56:32,182 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:56:32,255 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:56:32,257 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:56:32,359 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:56:32,360 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:56:32,360 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:56:32,447 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:56:32,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:56:32 BoogieIcfgContainer [2025-03-14 00:56:32,448 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:56:32,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:56:32,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:56:32,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:56:32,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:56:31" (1/3) ... [2025-03-14 00:56:32,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a6c2c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:56:32, skipping insertion in model container [2025-03-14 00:56:32,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:56:32" (2/3) ... [2025-03-14 00:56:32,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a6c2c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:56:32, skipping insertion in model container [2025-03-14 00:56:32,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:56:32" (3/3) ... [2025-03-14 00:56:32,453 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_25-struct_nr_true.i [2025-03-14 00:56:32,462 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:56:32,463 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_25-struct_nr_true.i that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-14 00:56:32,463 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:56:32,489 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 00:56:32,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 35 transitions, 77 flow [2025-03-14 00:56:32,530 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2025-03-14 00:56:32,532 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:56:32,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 34 events. 4/34 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-14 00:56:32,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 35 transitions, 77 flow [2025-03-14 00:56:32,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 32 transitions, 67 flow [2025-03-14 00:56:32,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:56:32,549 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;@23214868, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:56:32,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-14 00:56:32,554 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:56:32,554 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-14 00:56:32,554 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:56:32,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:32,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-14 00:56:32,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:56:32,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:32,558 INFO L85 PathProgramCache]: Analyzing trace with hash 209604, now seen corresponding path program 1 times [2025-03-14 00:56:32,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:32,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302186217] [2025-03-14 00:56:32,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:56:32,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:32,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-14 00:56:32,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-14 00:56:32,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:56:32,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:32,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:32,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302186217] [2025-03-14 00:56:32,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302186217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:32,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:32,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:56:32,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673417101] [2025-03-14 00:56:32,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:32,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:56:32,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:32,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:56:32,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:56:32,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-14 00:56:32,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-03-14 00:56:32,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:32,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-14 00:56:32,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:56:32,829 INFO L124 PetriNetUnfolderBase]: 49/152 cut-off events. [2025-03-14 00:56:32,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:56:32,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 152 events. 49/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 602 event pairs, 42 based on Foata normal form. 22/156 useless extension candidates. Maximal degree in co-relation 260. Up to 100 conditions per place. [2025-03-14 00:56:32,832 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 18 selfloop transitions, 4 changer transitions 3/33 dead transitions. [2025-03-14 00:56:32,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 119 flow [2025-03-14 00:56:32,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:56:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:56:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-03-14 00:56:32,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-03-14 00:56:32,842 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 67 flow. Second operand 3 states and 61 transitions. [2025-03-14 00:56:32,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 119 flow [2025-03-14 00:56:32,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:56:32,848 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 62 flow [2025-03-14 00:56:32,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2025-03-14 00:56:32,855 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2025-03-14 00:56:32,855 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 62 flow [2025-03-14 00:56:32,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-03-14 00:56:32,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:32,855 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:56:32,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:56:32,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:56:32,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:32,856 INFO L85 PathProgramCache]: Analyzing trace with hash -385991721, now seen corresponding path program 1 times [2025-03-14 00:56:32,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:32,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972446625] [2025-03-14 00:56:32,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:56:32,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:32,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 00:56:32,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 00:56:32,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:56:32,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:33,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972446625] [2025-03-14 00:56:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972446625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:33,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:33,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:56:33,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422622380] [2025-03-14 00:56:33,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:33,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:56:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:33,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:56:33,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:56:33,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-14 00:56:33,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-03-14 00:56:33,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:33,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-14 00:56:33,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:56:33,110 INFO L124 PetriNetUnfolderBase]: 48/147 cut-off events. [2025-03-14 00:56:33,110 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-14 00:56:33,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 147 events. 48/147 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 552 event pairs, 19 based on Foata normal form. 8/147 useless extension candidates. Maximal degree in co-relation 274. Up to 65 conditions per place. [2025-03-14 00:56:33,111 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 24 selfloop transitions, 6 changer transitions 3/41 dead transitions. [2025-03-14 00:56:33,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 160 flow [2025-03-14 00:56:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:56:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:56:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-03-14 00:56:33,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-14 00:56:33,113 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 62 flow. Second operand 5 states and 84 transitions. [2025-03-14 00:56:33,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 160 flow [2025-03-14 00:56:33,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:56:33,114 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 90 flow [2025-03-14 00:56:33,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2025-03-14 00:56:33,115 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2025-03-14 00:56:33,115 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 90 flow [2025-03-14 00:56:33,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-03-14 00:56:33,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:33,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:56:33,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:56:33,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:56:33,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:33,116 INFO L85 PathProgramCache]: Analyzing trace with hash -382074492, now seen corresponding path program 1 times [2025-03-14 00:56:33,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:33,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310896494] [2025-03-14 00:56:33,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:56:33,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:33,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-14 00:56:33,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-14 00:56:33,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:56:33,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:33,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:33,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310896494] [2025-03-14 00:56:33,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310896494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:33,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:33,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:56:33,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098041363] [2025-03-14 00:56:33,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:33,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:56:33,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:33,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:56:33,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:56:33,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-14 00:56:33,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-03-14 00:56:33,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:33,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-14 00:56:33,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:56:33,254 INFO L124 PetriNetUnfolderBase]: 53/145 cut-off events. [2025-03-14 00:56:33,254 INFO L125 PetriNetUnfolderBase]: For 57/65 co-relation queries the response was YES. [2025-03-14 00:56:33,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 145 events. 53/145 cut-off events. For 57/65 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 524 event pairs, 15 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 332. Up to 65 conditions per place. [2025-03-14 00:56:33,259 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 24 selfloop transitions, 5 changer transitions 6/42 dead transitions. [2025-03-14 00:56:33,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 196 flow [2025-03-14 00:56:33,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:56:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:56:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-03-14 00:56:33,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5028571428571429 [2025-03-14 00:56:33,260 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 90 flow. Second operand 5 states and 88 transitions. [2025-03-14 00:56:33,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 196 flow [2025-03-14 00:56:33,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:56:33,263 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 107 flow [2025-03-14 00:56:33,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2025-03-14 00:56:33,263 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2025-03-14 00:56:33,263 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 107 flow [2025-03-14 00:56:33,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-03-14 00:56:33,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:33,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:56:33,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:56:33,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:56:33,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:33,264 INFO L85 PathProgramCache]: Analyzing trace with hash -217858243, now seen corresponding path program 1 times [2025-03-14 00:56:33,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:33,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242198699] [2025-03-14 00:56:33,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:56:33,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:33,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 00:56:33,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 00:56:33,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:56:33,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:33,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:33,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242198699] [2025-03-14 00:56:33,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242198699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:33,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:33,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:56:33,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755745422] [2025-03-14 00:56:33,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:33,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:56:33,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:33,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:56:33,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:56:33,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-14 00:56:33,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-03-14 00:56:33,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:33,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-14 00:56:33,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:56:33,367 INFO L124 PetriNetUnfolderBase]: 15/69 cut-off events. [2025-03-14 00:56:33,367 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-14 00:56:33,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 69 events. 15/69 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 147 event pairs, 5 based on Foata normal form. 7/76 useless extension candidates. Maximal degree in co-relation 156. Up to 32 conditions per place. [2025-03-14 00:56:33,367 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 16 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-03-14 00:56:33,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 153 flow [2025-03-14 00:56:33,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:56:33,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:56:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-14 00:56:33,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-03-14 00:56:33,370 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 107 flow. Second operand 3 states and 62 transitions. [2025-03-14 00:56:33,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 153 flow [2025-03-14 00:56:33,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 30 transitions, 142 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-14 00:56:33,371 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 104 flow [2025-03-14 00:56:33,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2025-03-14 00:56:33,372 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2025-03-14 00:56:33,372 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 104 flow [2025-03-14 00:56:33,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-03-14 00:56:33,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:33,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:56:33,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:56:33,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:56:33,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:33,373 INFO L85 PathProgramCache]: Analyzing trace with hash 241412989, now seen corresponding path program 1 times [2025-03-14 00:56:33,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:33,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666718444] [2025-03-14 00:56:33,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:56:33,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:33,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 00:56:33,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 00:56:33,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:56:33,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:33,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:33,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666718444] [2025-03-14 00:56:33,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666718444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:33,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:33,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:56:33,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226802525] [2025-03-14 00:56:33,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:33,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:56:33,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:33,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:56:33,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:56:33,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-14 00:56:33,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-03-14 00:56:33,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:33,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-14 00:56:33,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:56:33,535 INFO L124 PetriNetUnfolderBase]: 17/70 cut-off events. [2025-03-14 00:56:33,535 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-14 00:56:33,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 70 events. 17/70 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 132 event pairs, 9 based on Foata normal form. 1/71 useless extension candidates. Maximal degree in co-relation 164. Up to 22 conditions per place. [2025-03-14 00:56:33,536 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 14 selfloop transitions, 4 changer transitions 10/32 dead transitions. [2025-03-14 00:56:33,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 171 flow [2025-03-14 00:56:33,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:56:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:56:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-03-14 00:56:33,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2025-03-14 00:56:33,536 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 104 flow. Second operand 6 states and 86 transitions. [2025-03-14 00:56:33,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 171 flow [2025-03-14 00:56:33,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 163 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:56:33,538 INFO L231 Difference]: Finished difference. Result has 39 places, 19 transitions, 74 flow [2025-03-14 00:56:33,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=39, PETRI_TRANSITIONS=19} [2025-03-14 00:56:33,538 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2025-03-14 00:56:33,538 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 19 transitions, 74 flow [2025-03-14 00:56:33,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-03-14 00:56:33,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:56:33,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:56:33,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:56:33,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:56:33,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:56:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1944943037, now seen corresponding path program 1 times [2025-03-14 00:56:33,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:56:33,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901842483] [2025-03-14 00:56:33,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:56:33,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:56:33,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 00:56:33,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 00:56:33,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:56:33,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:56:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:56:33,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:56:33,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901842483] [2025-03-14 00:56:33,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901842483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:56:33,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:56:33,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:56:33,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3772551] [2025-03-14 00:56:33,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:56:33,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:56:33,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:56:33,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:56:33,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:56:33,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2025-03-14 00:56:33,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 19 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-03-14 00:56:33,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:56:33,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2025-03-14 00:56:33,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:56:33,689 INFO L124 PetriNetUnfolderBase]: 11/42 cut-off events. [2025-03-14 00:56:33,689 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 00:56:33,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 42 events. 11/42 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 4 based on Foata normal form. 2/44 useless extension candidates. Maximal degree in co-relation 99. Up to 15 conditions per place. [2025-03-14 00:56:33,690 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 0 selfloop transitions, 0 changer transitions 21/21 dead transitions. [2025-03-14 00:56:33,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 21 transitions, 115 flow [2025-03-14 00:56:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 00:56:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 00:56:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2025-03-14 00:56:33,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3673469387755102 [2025-03-14 00:56:33,691 INFO L175 Difference]: Start difference. First operand has 39 places, 19 transitions, 74 flow. Second operand 7 states and 90 transitions. [2025-03-14 00:56:33,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 21 transitions, 115 flow [2025-03-14 00:56:33,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 21 transitions, 90 flow, removed 1 selfloop flow, removed 11 redundant places. [2025-03-14 00:56:33,692 INFO L231 Difference]: Finished difference. Result has 28 places, 0 transitions, 0 flow [2025-03-14 00:56:33,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=28, PETRI_TRANSITIONS=0} [2025-03-14 00:56:33,692 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2025-03-14 00:56:33,692 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 0 transitions, 0 flow [2025-03-14 00:56:33,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-03-14 00:56:33,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-03-14 00:56:33,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-03-14 00:56:33,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-14 00:56:33,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-03-14 00:56:33,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-03-14 00:56:33,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-03-14 00:56:33,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-03-14 00:56:33,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:56:33,695 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-14 00:56:33,698 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:56:33,698 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:56:33,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:56:33 BasicIcfg [2025-03-14 00:56:33,701 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:56:33,702 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:56:33,702 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:56:33,702 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:56:33,702 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:56:32" (3/4) ... [2025-03-14 00:56:33,703 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 00:56:33,705 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-14 00:56:33,707 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-03-14 00:56:33,707 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-14 00:56:33,707 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 00:56:33,707 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 00:56:33,755 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:56:33,755 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:56:33,755 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:56:33,756 INFO L158 Benchmark]: Toolchain (without parser) took 1987.43ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 109.6MB in the end (delta: 21.3MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2025-03-14 00:56:33,756 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:56:33,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.82ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 111.3MB in the end (delta: 19.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 00:56:33,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.26ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 109.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:56:33,757 INFO L158 Benchmark]: Boogie Preprocessor took 20.56ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 108.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:56:33,759 INFO L158 Benchmark]: IcfgBuilder took 306.96ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 84.6MB in the end (delta: 23.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 00:56:33,759 INFO L158 Benchmark]: TraceAbstraction took 1252.09ms. Allocated memory is still 167.8MB. Free memory was 84.2MB in the beginning and 115.9MB in the end (delta: -31.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:56:33,759 INFO L158 Benchmark]: Witness Printer took 53.90ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 109.6MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:56:33,761 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.15ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.82ms. Allocated memory is still 167.8MB. Free memory was 130.5MB in the beginning and 111.3MB in the end (delta: 19.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.26ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 109.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.56ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 108.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 306.96ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 84.6MB in the end (delta: 23.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1252.09ms. Allocated memory is still 167.8MB. Free memory was 84.2MB in the beginning and 115.9MB in the end (delta: -31.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 53.90ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 109.6MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 47 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: 1.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 288 IncrementalHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 6 mSDtfsCounter, 288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=3, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-03-14 00:56:33,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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